#include<bits/stdc++.h>
using namespace std;
int n;
int na;
int ls;
int maxx,sum[100010],maxxbianhao;
char a[110][1010];
int ls1,ls2,ls5;
char ls3,ls4;
int js;
int ans;
int main()
{
	cin>>n;
	//rewind(stdin);
	for(int i=0;i<=n;i++)
	{
		//cin.getline(a[i],1000);
		gets(a[i]);
	}
	for(int i=1;i<=n;i++)
	{
		na=strlen(a[i]);
		js=0;
		ls1=0;
		ls2=0;
		ls5=0;
		for(int j=0;j<na;j++)
		{
			if(a[i][j]==' ')
			{
				js++;
				continue;
			}
			switch(js)
			{
				case 1:
					ls1=ls1*10+int(a[i][j]-'0');
					break;
				case 2:
					ls2=ls2*10+int(a[i][j]-'0');
					break;
				case 3:
					ls3=a[i][j];
					break;
				case 4:
					ls4=a[i][j];
					break;
				case 5:
					ls5=ls5*10+int(a[i][j]-'0');
			}
		}
		if(ls1>80&&ls5>0)
		{
			sum[i]=sum[i]+8000;
		}
		if(ls1>85&&ls2>80)
		{
			sum[i]=sum[i]+4000;
		}
		if(ls1>90)
		{
			sum[i]=sum[i]+2000;
		}
		if(ls1>85&&ls4=='Y')
		{
			sum[i]=sum[i]+1000;
		}
		if(ls2>80&&ls3=='Y')
		{
			sum[i]=sum[i]+850;
		}
		if(sum[i]>maxx)
		{
			maxx=sum[i];
			maxxbianhao=i;
		}
		ans=ans+sum[i];
	}
	for(int i=0;;i++)
	{
		if(a[maxxbianhao][i]==' ')
		{
			break;
		}
		cout<<a[maxxbianhao][i];
	}
	cout<<endl<<maxx<<endl<<ans<<endl;
	return 0;
}

代码如上，下载数据点后经手动测试答案相同，但是wa了