哪不对呀

#include<bits/stdc++.h>
using namespace std;
int n,cnt;
struct Node{
	string s;
	int z;
}maxv;
int main(){
	cin>>n;
	maxv.z=0;
	for(int i=1;i<=n;i++){
		string name;
		int sum=0;
		char c1,c2;
		int q,j,l;
		cin>>name>>q>>j>>c1>>c2>>l;
		if(q>80&&l>=1) sum+=8000;
		if(q>85&&j>=80) sum+=4000;
		if(q>90) sum+=2000;
		if(q>85&&c2=='Y') sum+=1000;
		if(j>80&&c1=='Y') sum+=850;
		cnt+=sum;
		if(sum>maxv.z){
			maxv.z=sum;
			maxv.s=name;
		}
	}
	cout<<maxv.s<<endl<<maxv.z<<endl<<cnt;
	return 0; 
}