class Solution {
    public List<String> topKFrequent(String[] words, int k) {
        Map<String, Integer> map = new HashMap<>();
        
        for (String word : words) {
            map.put(word, map.getOrDefault(word, 1) + 1);
        }
        
        PriorityQueue<String> pq = new PriorityQueue<>(
            (a, b) -> map.get(a) == map.get(b) ? a.compareTo(b) : map.get(b) - map.get(a)
        );
        
        for (String key : map.keySet()) {
            pq.offer(key);
        }

        List<String> result = new LinkedList<>();
        
        for (int i = 0; i < k; i++) {
            result.add(pq.poll());
        }
        
        return result;
    }
}