<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> both of the same length. The <strong>advantage</strong> of <code>nums1</code> with respect to <code>nums2</code> is the number of indices <code>i</code> for which <code>nums1[i] &gt; nums2[i]</code>.</p>

<p>Return <em>any permutation of </em><code>nums1</code><em> that maximizes its <strong>advantage</strong> with respect to </em><code>nums2</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> nums1 = [2,7,11,15], nums2 = [1,10,4,11]
<strong>Output:</strong> [2,11,7,15]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> nums1 = [12,24,8,32], nums2 = [13,25,32,11]
<strong>Output:</strong> [24,32,8,12]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums1.length &lt;= 10<sup>5</sup></code></li>
	<li><code>nums2.length == nums1.length</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 10<sup>9</sup></code></li>
</ul>

# class Solution:
#     def advantageCount(self, nums1: List[int], nums2: List[int]) -> List[int]:
#         nums1.sort()
#         res = []
#         for index_i, i in enumerate(nums2):
#             flag = False
#             for index_j, j in enumerate(nums1):
#                 if nums1[index_j] > nums2[index_i]:
#                     res.append(nums1[index_j])
#                     nums1.pop(index_j)
#                     flag = True
#                     break
#             if not flag:
#                 min = nums1.pop(0)
#                 res.append(min)

#         return res


class Solution:
    def advantageCount(self, nums1: List[int], nums2: List[int]) -> List[int]:
        nums1.sort()
        res = nums2
        for i, ind in sorted([[-i, ind] for ind, i in enumerate(nums2)]):
            if nums1[-1] > -i:
                res[ind] = nums1[-1]
                nums1.pop(-1)
            else:
                res[ind] = nums1[0]
                nums1.pop(0)
        return res
   

            
41862