1
class Solution {
2
 public:
3
  bool static comp(pair<string, int> a, pair<string, int> b) {
4
    if (a.second > b.second)
5
      return true;
6
    else if (a.second < b.second)
7
      return false;
8
    else {
9
      return a.first < b.first;
10
    }
11
  }
12
  vector<string> topKFrequent(vector<string> &words, int k) {
13
    unordered_map<string, int> m;
14
    for (auto i : words) {
15
      m[i]++;
16
    }
17
    vector<pair<string, int>> v;
18
    for (auto i : m) {
19
      v.push_back(i);
20
    }
21
    sort(v.begin(), v.end(), comp);
22
    vector<string> ans;
23
    for (int i = 0; i < k; i++) {
24
      ans.push_back(v[i].first);
25
    }
26
    return ans;
27
  }
28
};