全WA求调

#include <bits/stdc++.h>

using namespace std;

struct k{
	string f;
	int j1,j2,l;
	char f1,f2;
	int p;
}a[105];
int main() {
    int n,ans=0;
    cin>>n;
    for(int i=1;i<=n;i++){
    	cin>>a[i].f;
    	cin>>a[i].j1>>a[i].j2>>a[i].f1>>a[i].f2>>a[i].l;
    	if(a[i].j1>80&&a[i].l>=1)a[i].p+=8000;
    	if(a[i].j1>85&&a[i].j2>=80)a[i].p+=4000;
    	if(a[i].j1>90)a[i].p+=2000;
    	if(a[i].j1>85&&a[i].f2=='Y')a[i].p+=1000;
    	if(a[i].j2>80&&a[i].f1=='Y')a[i].p+=850;
	}
	int max=0;
	string maxi;
	for(int i=1;i<=n;i++){
		if(max<a[i].p){
			max=a[i].p;
			maxi=a[i].f;
		}
		ans+=a[i].p;
	}
	cout<<maxi<<'\n'<<max<<'\n'<<ans;
	return 0;
}