L2-021 点赞狂魔 map

题目：https://www.patest.cn/contests/gplt/L2-021#include <bits/stdc++.h>
#define ll long long int
using namespace std;
const int maxn=100005;

struct node{
char name[10];
int num;
float ave;
}man[105];
map<int,int> m;
bool cmp(node a,node b){
return a.num==b.num?a.ave<b.ave:a.num>b.num;
}
int main(){
int n;
cin>>n;
for(int i=0;i<n;i++){
m.clear();
int k,id;
cin>>man[i].name>>k;
for(int j=0;j<k;j++){
cin>>id;
m[id]++;
}
int cnt=0; float sum=0;
for(map<int,int>::iterator it=m.begin();it!=m.end();++it){
cnt++;
sum+=it->second;
}
man[i].num=cnt;
man[i].ave=sum/(cnt*1.0);
}
sort(man,man+n,cmp);
for(int i=0;i<3;i++){
if(strlen(man[i].name))
printf("%s%c",man[i].name,i==2?'\n':' ');
else
printf("-%c",i==2?'\n':' ');
}
return 0;
}