1
class Solution {
2
 public:
3
  vector<int> frequencySort(vector<int> &nums) {
4
    map<int, int> mp;
5
    for (int i = 0; i < nums.size(); i++) {
6
      mp[nums[i]]++;
7
    }
8
    priority_queue<pair<int, int>> pq;
9
    for (auto it : mp) {
10
      pq.push({-it.second, it.first});
11
    }
12
    vector<int> result;
13
    while (!pq.empty()) {
14
      int x = pq.top().first;
15
      for (int i = 0; i < abs(x); i++) {
16
        result.push_back(pq.top().second);
17
      }
18
      pq.pop();
19
    }
20
    return result;
21
  }
22
};