24B - F1 Champions - CodeForces Solution

#include<bits/stdc++.h>
using namespace std;
const int MAX=59;
int a[MAX]= {25,18,15,12,10,8,6,4,2,1},n,t;
map<string,vector<int> > m;
vector<pair<vector<int>,string> > ans;
string s;
int main() {
cin>>t;
while (t--) {
cin>>n;
for (int i=0; i<n; i++) {
cin>>s;
if (m.find(s)==m.end())
m[s].resize(MAX);
m[s][0]+=a[i],m[s][i+1]++;
}
}
for (auto &v:m)
ans.push_back({v.second,v.first});
cout<<max_element(ans.begin(),ans.end())->second<<'\n';
for (auto &v:ans)
swap(v.first[0],v.first[1]);
cout<<max_element(ans.begin(),ans.end())->second<<'\n';
}