1
import heapq
2

3

4
class Solution:
5
    def topKFrequent(self, words: List[str], k: int) -> List[str]:
6

7
        li = {}
8
        for i in words:
9
            if i in li:
10
                li[i] += 1
11
            else:
12
                li[i] = 1
13

14
        heap = []
15
        for i in li:
16
            heap.append([-li[i], i])
17

18
        heapq.heapify(heap)
19

20
        ans = []
21
        for i in range(k):
22
            ans.append(heapq.heappop(heap)[1])
23

24
        return ans