7-29 点赞狂魔

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<map>
using namespace std;
int n,k,cnt;
struct person{
	string name;
	int ans;
	double ave;
}p[105];
bool cmp(const person &e,const person &r)
{
	if(e.ans==r.ans)
	return e.ave<r.ave;
	return e.ans>r.ans;
}
int main()
{
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>p[i].name>>k;
		map<int,int>q;
		int tmp=0;
		for(int j=1,x;j<=k;j++)
		{
			scanf("%d",&x);
			q[x]++;
			if(q[x]==1) tmp++;
		}
		p[i].ans=tmp;
		p[i].ave=(double)k/tmp;
	}
	sort(p+1,p+1+n,cmp);
	for(int i=n+1;i<=3;i++)
	p[i].name="-";
	cout<<p[1].name<<' '<<p[2].name<<' '<<p[3].name;
	return 0;
}