<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 {
public:
    struct cmp {
        bool operator()(pair<int, int> p1, pair<int, int> p2) {
            return p1.first < p2.first;
        }
    };
    
    vector<int> advantageCount(vector<int>& nums1, vector<int>& nums2) {
        sort(nums1.begin(), nums1.end());

        priority_queue<pair<int, int>, vector<pair<int, int>>, cmp> pq;
        for (int i = 0; i < nums2.size(); i++) {
            pq.push(make_pair(nums2[i], i));
        }

        int l = 0, r = nums1.size() - 1;
        vector<int> result(nums1.size());
        while (!pq.empty()) {
            pair<int, int> p = pq.top();
            pq.pop();
            
            int value = p.first, index = p.second;

            // cout << value << " " << index << " " << nums1[r] << endl;
            if (nums1[r] > value) {
                result[index] = nums1[r--];
            } else {
                result[index] = nums1[l++];
            }
        }
        return result;
    }
};
66500