Least Number of Unique Integers after K Removals

Given an array of integers arr and an integer k. Find the least number of unique integers after removing exactly k elements.

Example 1:

Input: arr = [5,5,4], k = 1
Output: 1
Explanation: Remove the single 4, only 5 is left.

Example 2:

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

Constraints:

• 1 <= arr.length <= 10^5
• 1 <= arr[i] <= 10^9
• 0 <= k <= arr.length

思路：就是个统计integer频率，然后排序，要想remove后的unique数目最少，那么也就是remove的个数最多，那么就应该从频率低的开始remove，这样去掉的integer就是最多的。注意后面count >= node.fre的时候，poll才有效果，否则还是要加进去；

class Solution {
    private class Node {
        public int value;
        public int fre;
        public Node(int value, int fre) {
            this.value = value;
            this.fre = fre;
        }
    }
    
    public int findLeastNumOfUniqueInts(int[] arr, int k) {
        HashMap<Integer, Integer> countMap = new HashMap<>();
        for(int i = 0; i < arr.length; i++) {
            countMap.put(arr[i], countMap.getOrDefault(arr[i], 0) + 1);
        }
        
        PriorityQueue<Node> pq = new PriorityQueue<Node>((a, b) -> a.fre - b.fre);
        for(Integer key: countMap.keySet()) {
            pq.offer(new Node(key, countMap.get(key)));
        }
        
        int count = k;
        while(count > 0 && !pq.isEmpty()) {
            Node node = pq.poll();
            if(count >= node.fre) {
                count -= node.fre;
            } else {
                node.fre -= count;
                count = 0;
                pq.offer(node);
            }
        }
        return pq.size();
    }
}