<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:
    vector<string> sortPeople(vector<string>& names, vector<int>& heights) {
        if(heights.size() == 0){
            return names;
        }
        int s = 0;
        int e = heights.size()-1;
        mergeSort(names, heights, s , e);
        for(int i=0; i<heights.size(); i++) {
            cout<<heights[i]<<" ";
        }
        return names;
    }
    void mergeSort(vector<string>& names, vector<int>& heights, int s, int e) {
        
        if(s>=e){
            return ;
        }
        int mid = (e-s)/2 + s;
        mergeSort(names, heights, s, mid);
        mergeSort(names, heights, mid+1, e);
        merge(names, heights, s, mid , e);
        cout<<heights[0]<<" "<<heights[1]<<" "<<heights[2];
        return ;
    }
    void merge(vector<string>& names, vector<int>& heights, int s, int mid, int e){
        int left = s;
        int right = mid + 1;

        while (left <= mid && right <= e) {
            if (heights[left] >= heights[right]) {
                left++;
            } else {
                int valueToInsert = heights[right];
                string nameToInsert = names[right];

                // Shift elements to the right
                int i;
                for (i = right; i > left; i--) {
                    heights[i] = heights[i - 1];
                    names[i] = names[i - 1];
                }
                heights[i] = valueToInsert;
                names[i] = nameToInsert;

                left++;
                mid++;
                right++;
            }
        }
    }
};
29858