1class Solution {2    public int[] topKFrequent(int[] nums, int k) {3        Map<Integer, Integer> count = new HashMap<>();4        for (int value : nums) count.merge(value, 1, Integer::sum);5        PriorityQueue<Integer> heap = new PriorityQueue<>((a, b) ->6            count.get(a).equals(count.get(b)) ? Integer.compare(a, b)7                : Integer.compare(count.get(a), count.get(b)));8        for (int value : count.keySet()) {9            heap.add(value);10            if (heap.size() > k) heap.remove();11        }12        int[] result = new int[k];13        for (int i = 0; i < k; i++) result[i] = heap.remove();14        Arrays.sort(result);15        return result;16    }17}