1481. Least Number of Unique Integers after K Removals

class Solution {
public:
    int findLeastNumOfUniqueInts(vector<int>& arr, int k) {
        
        unordered_map<int,int>mp;
        for(auto a:arr){
            mp[a]++;
        }
        vector<int>v;
        int ct=0;
        for(auto a:mp){
            v.push_back(a.second);
        }
        sort(v.begin(),v.end());
        for(int i=0;i<v.size();i++){
            if(k>v[i]){
                k-=v[i];
                v[i]=0;
            }else{
                v[i]-=k;
                k=0;
            }
            if(v[i]!=0){
                ct++;
            }

        }
        return ct;

        }
        
    
};