<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 {
    void merge(vector<string>& names, vector<int>& heights, int l, int r, int m){
        int n1 = m-l+1;
        int n2 = r-m;
        int v1[n1], v2[n2];
        string names1[n1], names2[n2];
        for(int i=l;i<=m;i++){
            v1[i-l] = heights[i];
            names1[i-l] = names[i];
        } 
        for(int i=m+1;i<=r;i++){
            v2[i-m-1] = heights[i];
            names2[i-m-1] = names[i];
        } 
        int i=0, j=0, k=l;
        while(i<n1 && j<n2){
            if(v1[i]>v2[j]){
                names[k] = names1[i];
                heights[k++] = v1[i++];
            } else {
                names[k] = names2[j];
                heights[k++] = v2[j++];
            }
        }
        while(i<n1){
            names[k] = names1[i];
            heights[k++] = v1[i++];
        }
        while(j<n2){
            names[k] = names2[j];
            heights[k++] = v2[j++];
        }
    }
    void mergeSort(vector<string>& names, vector<int>& heights, int l, int r){
        if(l==r) return;
        int m = (l+r)>>1;
        mergeSort(names, heights, l, m);
        mergeSort(names, heights, m+1, r);
        merge(names, heights, l, r, m);
    }
public:
    vector<string> sortPeople(vector<string>& names, vector<int>& heights) {
        mergeSort(names, heights, 0, heights.size()-1);
        for(int i: heights) cout<<i<<" ";
        return names;
    }
};
31783