You are given two integer arrays nums1 and nums2 both of the same length. The advantage of nums1 with respect to nums2 is the number of indices i for which nums1[i] > nums2[i].
Return any permutation of nums1 that maximises its advantage with respect to nums2.
1 <= nums1.length <= 10^5nums2.length == nums1.length0 <= nums1[i], nums2[i] <= 10^9nums1 = [2,7,11,15], nums2 = [1,10,4,11][2,11,7,15]nums1 = [12,24,8,32], nums2 = [13,25,32,11][24,32,8,12]