347. Top K Frequent Elements

class Solution {
public:
    vector<int> topKFrequent(vector<int>& nums, int k) {
        unordered_map<int,int> map;
        vector<int> res;
        for(int i=0;i<nums.size();i++)
            map[nums[i]]++;
        priority_queue<pair<int,int>> pq;
        for(auto it=map.begin();it!=map.end();it++){
            pair<int,int> temp(it->second,it->first);
            pq.push(temp);
            if(pq.size()>map.size()-k){
                res.push_back(pq.top().second);
                pq.pop();
            }
        }
        return  res;
    }
};