Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- int main()
- {
- int n, k;
- cin >> n >> k;
- map<string, int> nombres;
- for(int i=0; i<n; i++)
- {
- string p;
- cin >> p;
- nombres[p]++;
- }
- map<string, int>::iterator it=nombres.begin();
- vector<pair<int, string> > res;
- for(int i=0; i<nombres.size(); i++)
- {
- res.push_back(make_pair(it->second, it->first));
- it++;
- }
- sort(res.rbegin(), res.rend());
- for(int i=0; i<k; i++)
- cout << res[i].second << " " << res[i].first << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement