<p>Given an array of integers&nbsp;<code>arr</code>&nbsp;and an integer <code>k</code>.&nbsp;Find the <em>least number of unique integers</em>&nbsp;after removing <strong>exactly</strong> <code>k</code> elements<b>.</b></p>

<ol>
</ol>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input: </strong>arr = [5,5,4], k = 1
<strong>Output: </strong>1
<strong>Explanation</strong>: Remove the single 4, only 5 is left.
</pre>
<strong class="example">Example 2:</strong>

<pre>
<strong>Input: </strong>arr = [4,3,1,1,3,3,2], k = 3
<strong>Output: </strong>2
<strong>Explanation</strong>: Remove 4, 2 and either one of the two 1s or three 3s. 1 and 3 will be left.</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= arr.length&nbsp;&lt;= 10^5</code></li>
	<li><code>1 &lt;= arr[i] &lt;= 10^9</code></li>
	<li><code>0 &lt;= k&nbsp;&lt;= arr.length</code></li>
</ul>
class Solution {
public:
    int findLeastNumOfUniqueInts(vector<int>& arr, int k) {
        
        unordered_map<int,int>mp;
        if(k==arr.size())return 0;

        for(int i = 0;i<arr.size();i++){
            mp[arr[i]]++;
        }
        
        priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
        
        for(auto it : mp){
            pq.push({it.second,it.first});
        }
        set<int>s;
       
        while(!pq.empty() && k>0){

            int num = pq.top().second;
            int f = pq.top().first;
            pq.pop();
            
            if(k>=f){
                k-=f;
            }
            else{
                int nw = f - k;
                k=0;
                pq.push({nw,num});
                cout<<"hm"<<" ";
            }
            cout<<pq.size()<<" ";
            

        }

        while(!pq.empty()){
            int num = pq.top().second;
            pq.pop();

            s.insert(num);
        }

        return s.size();

    }
};
77700