870_AdvantageShuffle - a920604a/leetcode GitHub Wiki

class Solution {
public:
    vector<int> advantageCount(vector<int>& nums1, vector<int>& nums2) {
        auto cmp = [](pair<int,int> & a, pair<int,int>& b){
            return a.first<b.first;
        };
        priority_queue<pair<int,int>,vector<pair<int,int>>, decltype(cmp) > pq(cmp);
        for(int i=0;i<nums2.size();++i) pq.push(make_pair(nums2[i], i) );
        
        sort(nums1.begin(),nums1.end());
        vector<int>ret(nums1.size(), 0);
        int l = 0, r = nums1.size()-1;
        while(!pq.empty()){
            int maxVal = pq.top().first, i = pq.top().second;
            pq.pop();
            if(maxVal >= nums1[r]){
                ret[i] = nums1[l++];
            }
            else{
                ret[i] = nums1[r--];
            }
        }
        return ret;
    }
};