0分WA求调

#include<bits/stdc++.h>
using namespace std;
struct node{
	string name;
	int qm;
	int bj;
	char gb;
	char xb;
	int lw;
	int zs;
	int bh;
}k[110];
bool cmp(node x,node y){
	if (x.zs==y.zs) return x.bh<y.bh;
	else return x.zs>y.zs;
}
int main()
{
	int n;
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>k[i].name>>k[i].qm>>k[i].bj>>k[i].gb>>k[i].xb>>k[i].lw;
		k[i].bh=i;
	}
	for (int i=1;i<=n;i++){
		if (k[i].qm>80 and k[i].lw>=1) k[i].zs+=8000;
		if (k[i].qm>85 and k[i].bj>=80) k[i].zs+=4000;
		if (k[i].qm>90) k[i].zs+=2000;
		if (k[i].qm>85 and k[i].xb=='Y') k[i].zs+=1000;
		if (k[i].bj>80 and k[i].gb=='Y') k[i].zs+=850;
	}
	int sum=0;
	for (int i=1;i<=n;i++){
		sum+=k[i].zs;
	}
	sort(k+1,k+n+1,cmp);
	cout<<k[1].name<<"\n"<<k[1].zs<<"\n"<<sum;
	return 0;
}