fork download 
  1. #include <bits/stdc++.h>
  2. #include <iostream>
  3. #include <set>
  4. #include <vector>
  5. #include <algorithm>
  6. #include <string>
  7. #include <cmath>
  8. using namespace std;
  9. #define ll                     long long
  10. #define _CRT_SECURE_NO_WARNINGS
  11. #define endl                   '\n'
  12. #define time clock_t tStart = clock();
  13. #define show printf("Time taken: %.6fs\n", (double)(clock() - tStart)/CLOCKS_PER_SEC);
  14. #define loop(a,b)             for(int i=a;i<=b;++i)
  15. #define count_1(n)            __builtin_popcountll(n)
  16. #define pb                    push_back
  17. #define f                     first
  18. #define s                     second
  19. #define MOD                   1000000007
  20. #define itoc(c)               ((char)(((int)'0')+c))
  21. #define V                     vector<int>
  22. #define Vl                      vector<ll>
  23. #define pll                   pair<ll,ll>
  24. #define Vp                    vector<pair<int,int>>
  25. #define all(v)                v.begin(),v.end()
  26. #define mid(s,e)              (s+(e-s)/2)
  27. #define tcase()               ll t,n; cin>>t;n=t; while(t--)
  28. #define eb                    emplace_back
  29. #define ull                   unsigned long long
  30. #define minimize              INT_MAX
  31. #define maximize              INT_MIN
  32. #define dsort(a)              sort(a.begin(), a.end(), greater<int>())
  33. #define fr(i,n)               for(ll i=0; i<n; i++)
  34. #define fr1(i,n)              for(ll i=1; i<=n; i++)
  35. #define vp(n)                vector<pair<int,int>>v(n);
  36. #define si                   set <int>
  37.  
  38. void fast(){
  39.     ios_base::sync_with_stdio(0);
  40.     cin.tie(0);
  41.     cout.tie(0);
  42.     //cout.setf(ios::fixed);
  43.     //cout.precision(20);
  44.     #ifndef _offline
  45.     // freopen("mex.in", "r", stdin);
  46.     //freopen("output.txt", "w", stdout);
  47.     #endif
  48. }
  49.  
  50. bool compare(pair<string, int> p1 , pair<string, int> p2){
  51.     if (p1.second != p2.second){
  52.         return p1.second > p2.second;
  53.     }
  54.     return p1.first < p2.first;
  55. }
  56.  
  57. void HaXn() {
  58.     int t; cin >> t;
  59.     map <string, double>mp;
  60.     while (t--){
  61.         int n; cin >>n;
  62.         double val = 1000.0;
  63.         map <string , int>mp2;
  64.         fr(i,n){
  65.             string str; cin >> str;
  66.             if (!mp2[str]) {
  67.                 mp[str] += round(val);
  68.                 val -= round((val * (10.0 / 100.0)));
  69.             }
  70.             mp2[str] ++;
  71.         }
  72.     }
  73.     vector<pair <string, double>>v(mp.size());
  74.     int index =0;
  75.     for (auto val : mp){
  76.         v[index].first = val.first;
  77.         v[index].second = val.second;
  78.         index ++;
  79.     }
  80.     sort(v.begin(),v.end(), compare);
  81.     cout << v[0].first << endl;
  82.     for (auto val: v){
  83.         cout << val.f << " "<< val.s << endl;
  84.     }
  85.  
  86.  
  87. }
  88.  
  89.  
  90.  
  91.  
  92.  
  93. int main() {
  94.     fast();
  95.     HaXn();
  96. }
Success #stdin #stdout 0s 5288KB
comments ()
stdin 
2
3 karemo ahmedezzat ahmedtom
3 karemo ahmedtom ahmedezzat
stdout 
karemo
karemo 2000
ahmedezzat 1710
ahmedtom 1710
https://ideone.com/tQaHm4
language:
C++ (gcc 8.3)
created:
5 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!