RT，下载样例测试之后完全一样，看看先？

#include<iostream>
#include<cstdio>
#include<algorithm>
#define MAXN 108
using namespace std;
int n,cnt=0;
struct student{
	string name;
	char x1,x2;
	int scoreq,scoreb,ln;
	int sum=0;
};
student a[MAXN];
bool cmp(student x,student y){
	return x.sum>y.sum;
}
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i].name;
		cin>>a[i].scoreq>>a[i].scoreb;
		cin>>a[i].x1>>a[i].x2;
		cin>>a[i].ln;
		if(a[i].scoreq>80&&a[i].ln>=1) a[i].sum+=8000;
		if(a[i].scoreq>85&&a[i].scoreb>80) a[i].sum+=4000;
		if(a[i].scoreq>90) a[i].sum+=2000;
		if(a[i].scoreq>85&&a[i].x2=='Y') a[i].sum+=1000;
		if(a[i].scoreb>80&&a[i].x1=='Y') a[i].sum+=850;
		cnt+=a[i].sum;
	}
	sort(a,a+n,cmp);
	cout<<a[0].name<<endl<<a[0].sum<<endl<<cnt<<endl;
	return 0;
}