<p>You are given an array of strings <code>names</code>, and an array <code>heights</code> that consists of <strong>distinct</strong> positive integers. Both arrays are of length <code>n</code>.</p>

<p>For each index <code>i</code>, <code>names[i]</code> and <code>heights[i]</code> denote the name and height of the <code>i<sup>th</sup></code> person.</p>

<p>Return <code>names</code><em> sorted in <strong>descending</strong> order by the people&#39;s heights</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> names = [&quot;Mary&quot;,&quot;John&quot;,&quot;Emma&quot;], heights = [180,165,170]
<strong>Output:</strong> [&quot;Mary&quot;,&quot;Emma&quot;,&quot;John&quot;]
<strong>Explanation:</strong> Mary is the tallest, followed by Emma and John.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> names = [&quot;Alice&quot;,&quot;Bob&quot;,&quot;Bob&quot;], heights = [155,185,150]
<strong>Output:</strong> [&quot;Bob&quot;,&quot;Alice&quot;,&quot;Bob&quot;]
<strong>Explanation:</strong> The first Bob is the tallest, followed by Alice and the second Bob.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == names.length == heights.length</code></li>
	<li><code>1 &lt;= n &lt;= 10<sup>3</sup></code></li>
	<li><code>1 &lt;= names[i].length &lt;= 20</code></li>
	<li><code>1 &lt;= heights[i] &lt;= 10<sup>5</sup></code></li>
	<li><code>names[i]</code> consists of lower and upper case English letters.</li>
	<li>All the values of <code>heights</code> are distinct.</li>
</ul>

class Solution {
public:
    void merge(vector<int>& v, int start, int mid, int end) {
        vector<int> left_vector(v.begin() + start, v.begin() + mid + 1);
        vector<int> right_vector(v.begin() + mid + 1, v.begin() + end + 1);

        int index = start, i = 0, j = 0;

        while (i < left_vector.size() && j < right_vector.size()) {
            if (left_vector[i] >= right_vector[j]) {
                v[index] = left_vector[i];
                index++;
                i++;
            } else {
                v[index] = right_vector[j];
                index++;
                j++;
            }
        }
        while (i < left_vector.size()) {
            v[index] = left_vector[i];
            index++;
            i++;
        }
        while (j < right_vector.size()) {
            v[index] = right_vector[j];
            index++;
            j++;
        }
    }

    void mergeSort(vector<int>& h, int l, int r) {
        if (l < r) {
            int mid = l + (r - l) / 2;
            mergeSort(h, l, mid);
            mergeSort(h, mid + 1, r);
            merge(h, l, mid, r);
        }
    }
    vector<string> sortPeople(vector<string>& names, vector<int>& heights) {
        unordered_map<int,int> mp;
        vector<string> res;
        for(int i =0 ; i<heights.size(); i++){
            mp[heights[i]] = i;
        }
        
        mergeSort(heights, 0, heights.size()-1);

    
        for(auto ch: heights){
            res.push_back(names[mp[ch]]);
        }
        return res;
    }
};
33516