For each index i, names[i] and heights[i] denote the name and height of the ith person.

Return names sorted in descending order by the people’s heights.

Example 1:

Input: names = ["Mary","John","Emma"], heights = [180,165,170]
Output: ["Mary","Emma","John"]
Explanation: Mary is the tallest, followed by Emma and John.

Example 2:

Input: names = ["Alice","Bob","Bob"], heights = [155,185,150]
Output: ["Bob","Alice","Bob"]
Explanation: The first Bob is the tallest, followed by Alice and the second Bob.

Constraints:

• n == names.length == heights.length
• 1 <= n <= 103
• 1 <= names[i].length <= 20
• 1 <= heights[i] <= 105
• names[i] consists of lower and upper case English letters.
• All the values of heights are distinct.

Solution: Zip and sort

Time complexity: O(nlogn)
Space complexity: O(n)

// Author: Huahua
class Solution {
public:
  vector<string> sortPeople(vector<string>& names, vector<int>& heights) {
    vector<pair<int, string*>> data;
    for (int i = 0; i < names.size(); ++i)
      data.emplace_back(heights[i], &names[i]);    
    sort(rbegin(data), rend(data));
    vector<string> ans(names.size());
    for (int i = 0; i < names.size(); ++i)
      ans[i].swap(*data[i].second);
    return ans;
  }
};

The post 花花酱 LeetCode 2418. Sort the People appeared first on Huahua's Tech Road.