#include <unordered_map>
#include <algorithm>
#include <iostream>
#include <vector>
bool Compare(std::pair<int, int> p1, std::pair<int, int> p2) {
if (p1.second == p2.second)
return p1.first > p2.first;
return p1.second > p2.second;
}
void PrintKMostFrequentNumbers(int arr[], int size, int K) {
std::unordered_map<int, int> mp;
for (int i = 0; i < size; i++)
mp[arr[i]]++;
std::vector<std::pair<int, int>> frequent_vec(mp.begin(), mp.end());
std::sort(frequent_vec.begin(), frequent_vec.end(), Compare);
for (int i = 0; i < K; i++)
std::cout << frequent_vec[i].first << " ";
}
int main()
{
int arr[] = { 4, 5, 19, 50, 7, 19, 8, 19, 3, 3, 6, 3, 27, 19, 3, 3 };
int size = sizeof(arr) / sizeof(arr[0]);
int K = 2;
PrintKMostFrequentNumbers(arr, size, K);
}
/*
run:
3 19
*/
