<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 Person {
public:
    string name;
    int height;
    Person(string name, int height) : name(name), height(height) {};
};

using vp = vector<Person>;
using vs = vector<string>;

class Solution {
public:
    vector<string> sortPeople(vector<string>& names, vector<int>& heights) {

        const int SIZE = names.size();

        vp peoples;
        peoples.reserve(SIZE+1);

        for (int i=0; i<SIZE; i++) {
            
            const string name = names[i];
            const int height = heights[i];
            peoples.emplace_back(name, height);

        }

        sort(peoples.begin(), peoples.end(), [](const Person &lhs, const Person &rhs) {
            return lhs.height > rhs.height;
        });

        // for (int i=0; i<SIZE; i++) {

        //     for (int j=0; j<SIZE-1-i; j++) {
                
        //         const int pivotHeight = peoples[j].height;
        //         const int targetHeight = peoples[j+1].height;

        //         if (pivotHeight < targetHeight) {
        //             swap(peoples[j], peoples[j+1]);
        //         }

        //     }

        // }

        // for (int i=1; i<SIZE; i++) {
        //     for (int j=0; j<i; j++) {

        //         if (peoples[j].height < peoples[i].height) {
        //             swap(peoples[i], peoples[j]);
        //         }

        //     }
        // }
        
        vs answer = {};
        answer.reserve(SIZE);

        for (const auto &person : peoples) {
            answer.emplace_back(person.name);
        }

        return answer;
    }
};
24853