<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) {
        map<char,int>m;
        vector<int>digits(10,0);

        for(char c:s){
            m[c]++;
        }

        digits[0]=m['z'];
        digits[2]=m['w'];
        digits[4]=m['u'];
        digits[6]=m['x'];
        digits[8]=m['g'];

        digits[3]=m['h']-digits[8];
        digits[5]=m['f']-digits[4];
        digits[7]=m['v']-digits[5];
        digits[1]=m['o']-digits[2]-digits[4]-digits[0];
        digits[9]=m['i']-digits[5]-digits[8]-digits[6];
    string result;
     for(int i=0;i<10;i++){
        result.append(digits[i],'0'+i);
     }
     return result;
    }
};
11900