<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>mp;

        for(int i=0;i<s.length();i++)
        {
            mp[s[i]]++;

        }

        vector<int>num(10,0);
        num[0]=mp['z'];
        mp['e']-=mp['z'];
        mp['r']-mp['z'];
        mp['o']-=mp['z'];
        mp['z']=0;

        num[2]=mp['w'];
        mp['t']-=mp['w'];
        mp['o']-=mp['w'];
        mp['w']=0;

        num[4]=mp['u'];
        mp['f']-=mp['u'];
        mp['o']-=mp['u'];
        mp['r']-=mp['u'];
        mp['u']=0;


        num[6]=mp['x'];
        mp['s']-=mp['x'];
        mp['i']-=mp['x'];
        mp['x']=0;

        num[8]=mp['g'];
        mp['e']-=mp['g'];
        mp['i']-=mp['g'];
        mp['h']-=mp['g'];
        mp['t']-=mp['g'];
        mp['g']=0;

        num[1]=mp['o'];
        mp['n']-=mp['o'];
        mp['e']-=mp['o'];
        mp['o']=0;

       

        num[5]=mp['f'];
        mp['i']-=mp['f'];
        mp['v']-=mp['f'];
        mp['e']-=mp['f'];
        mp['f']=0;

          num[7]=mp['s'];
        mp['e']-=mp['s'];
        mp['e']-=mp['s'];
        mp['v']-=mp['s'];
       mp['n']-=mp['s'];


         num[3]=mp['h'];
        mp['t']-=mp['h'];
        mp['r']-=mp['h'];
        mp['e']-=mp['h'];
        mp['e']-=mp['h'];
        mp['h']=0;

      


       num[9]=mp['i'];
       
 string str="";
       for(int i=0;i<=9;i++)
       {
          for(int j=0;j<num[i];j++)
          {
             str+=to_string(i);
          }

       }
       return str;

    
    }
};
//one-----o
//five----f
//seven---s
//three---h
//nine----i

13800