You are given an array of strings names, and an array heights consisting of distinct positive integers, where both arrays have a length of n.

For each index i, names[i] and heights[i] represent the name and height of the $i^{ ext{th}}$ person.

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

Constraints:

• n $==$ names.length $==$ heights.length

• $1 \leq$ n $\leq 10^3$

• $1 \leq$ names[i].length $\leq 20$

• $1 \leq$ heights[i] $\leq 10^5$

• names[i] consists of lowercase and uppercase English letters.

• All the values of heights are distinct.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.