<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]:
        
        X=nums1.copy()
        X.sort()

        Y=nums2.copy()
        Y.sort()

        # print(X)
        # print(Y)


        i=0
        j=0

        flag=True
        num_dict={}
        false_list=[]
        while flag:

            if i>=len(X) or j>=len(Y):
                flag=False
            else:
                if X[i]>Y[j]:
                    if Y[j] in num_dict.keys():
                        num_dict[Y[j]].append(X[i])
                    else:
                        num_dict[Y[j]]=[X[i]]

                    i+=1
                    j+=1
                else:
                    false_list.append(X[i])
                    i+=1

        # print(num_dict)

        # print(false_list)
        new_list=[0 for _ in range(len(nums1))]




        for i in range(len(nums2)):
            curr_num=nums2[i]
            if curr_num in num_dict.keys():
                val_list=num_dict[curr_num]
                if val_list==[]:
                    mynum=false_list.pop()
                    new_list[i]=mynum
                else:
                    mynum=val_list.pop()
                    new_list[i]=mynum
            else:
                mynum=false_list.pop()
                new_list[i]=mynum
        
        return new_list
43152