<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]:
        store1 = []
        store2 = []
        for x in range(len(nums1)):
            store1.append((nums1[x],x))
            store2.append((nums2[x],x))
        store1.sort(reverse =True)
        store2.sort(reverse=True)
        ans = [None]*len(nums1)
        rem = []
        while len(store1) > 0:
            if store1[len(store1) -1][0] > store2[len(store2) -1][0]:
                ans[store2[len(store2) -1][1]] = store1[len(store1) -1][0]
                store2.pop()
                store1.pop()
            else:
                rem.append(store1[len(store1) -1][0])
                store1.pop()
        for x in range(len(ans)):
            if ans[x] == None:
                ans[x] = rem[0]
                rem = rem[1:]
        return ans
        
        
44872