<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) {
        vector<string> digitWords{
            "zero",
            "one",
            "two",
            "three",
            "four",
            "five",
            "six",
            "seven",
            "eight",
            "nine",
            "ten"
        };

        vector<int> charCounts(26, 0);

        for (char c : s)
            charCounts[c-'a']++;

        vector<int> digitCounts(10, 0);

        vector<pair<int, char>> identifyingChar{
            {0,'z'},
            {6,'x'},
            {2,'w'},
            {4,'u'},
            {8,'g'},
            {3,'r'},
            {7,'s'},
            {5,'v'},
            {9,'i'},
            {1,'o'},
        };

        for (auto& pair : identifyingChar) {
            digitCounts[pair.first] = charCounts[pair.second-'a'];
            for (char c : digitWords[pair.first])
                charCounts[c-'a'] -= digitCounts[pair.first];
        }

        string s2 = "";
        for (int i = 0; i < digitCounts.size(); i++) {
            s2 += string(digitCounts[i], '0'+i);
        }
        return s2;
    }
};
11100