<p>Given a string <code>s</code> containing an out-of-order English representation of digits <code>0-9</code>, return <em>the digits in <strong>ascending</strong> order</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> s = "owoztneoer"
<strong>Output:</strong> "012"
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> s = "fviefuro"
<strong>Output:</strong> "45"
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s[i]</code> is one of the characters <code>[&quot;e&quot;,&quot;g&quot;,&quot;f&quot;,&quot;i&quot;,&quot;h&quot;,&quot;o&quot;,&quot;n&quot;,&quot;s&quot;,&quot;r&quot;,&quot;u&quot;,&quot;t&quot;,&quot;w&quot;,&quot;v&quot;,&quot;x&quot;,&quot;z&quot;]</code>.</li>
	<li><code>s</code> is <strong>guaranteed</strong> to be valid.</li>
</ul>

class Solution {
public:
    string originalDigits(string s) {
        unordered_map<char,int> count;
        for(char c : s)
            count[c]++;

        vector<int> digit(10,0);
        digit[0] = count['z'];
        digit[2] = count['w'];
        digit[4] = count['u'];
        digit[6] = count['x'];
        digit[8] = count['g'];

        digit[1] = count['o'] - digit[0] - digit[2] - digit[4];
        digit[3] = count['h'] - digit[8];
        digit[5] = count['f'] - digit[4];
        digit[7] = count['s'] - digit[6]; 
        digit[9] = count['i'] - digit[5] - digit[6] - digit[8];
        string ans = "";
        for(int i=0; i<10; i++){
            ans += string(digit[i], '0' + i);
        }
    return ans;
    }
};
12000