fork download
copy 
  1. // title:Top K Frequent Elements
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. bool cmp(pair<int,int>&a,pair<int,int>&b)
  5. {
  6.     if(a.second!=b.second)
  7.         return a.second>b.second;
  8.     else
  9.         return a.first<b.first;
  10. }
  11. int main(){
  12.    // write your code here
  13.    int tq;
  14.    cin>>tq;
  15.    while(tq--)
  16.    {
  17.        int n,k;
  18.        cin>>n>>k;
  19.        map<int,int>mp;
  20.        for(int i=0;i<n;i++)
  21.        {
  22.            int a;
  23.            cin>>a;
  24.            mp[a]++;
  25.        }
  26.        vector<pair<int,int>>p;
  27.        for(auto i:mp)
  28.        {
  29.            p.push_back(i);
  30.        }
  31.        sort(p.begin(),p.end(),cmp);
  32.        for(int i=0;i<n;i++)
  33.        {
  34.            if(i+1<=k)
  35.            {
  36.                cout<<p[i].first<<" ";
  37.            }
  38.        }
  39.        cout<<"\n";
  40.    }
  41.     return 0;
  42. }
Success #stdin #stdout 0.01s 5448KB
comments (?)
stdin
copy 
2
6 2
1 1 1 2 2 3
1 1
1
stdout
copy 
1 2 
1
https://ideone.com/m8rHIo
language:
C++ (gcc 8.3)
created:
328 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!