You are given two integer arrays, nums1 and nums2, both of the same length.

The advantage of nums1 with respect to nums2 is defined as the total number of indices i such that nums1[i] > nums2[i].

Return any permutation of nums1 that maximizes its advantage with respect to nums2.

Constraints:

• $1 \leq$ nums1.length $\leq 10^5$

• nums2.length $==$ nums1.length

• $0 \leq$ nums1[i], nums2[i] $\leq 10^9$

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.