这咋就全WA了呢？

include<iostream>
#include<algorithm>
using namespace std;

struct A{
	char s[22];
	int q,b,l,m,id;
	char xu,xi;
}a[111]={};

bool c(A x,A y){
	if(x.m==y.m){
		return x.id<y.id;
	}
	return x.m>y.m;
}
int main(){
	int n,cnt=0;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i].s>>a[i].q>>a[i].b>>a[i].xu>>a[i].xi>>a[i].l;
		a[i].id=i;
		if(a[i].q>80&&a[i].l>0){
			a[i].m+=8000;
		}
		if(a[i].q>85&&a[i].b>80){
			a[i].m+=4000;
		}
		if(a[i].q>90){
			a[i].m+=2000;
		}
		if(a[i].q>85&&a[i].xi=='Y'){
			a[i].m+=1000;
		}
		if(a[i].b>80&&a[i].xu=='Y'){
			a[i].m+=850;
		}
		cnt+=a[i].m;
	}
	sort(a,a+n,c);
	cout<<a[0].id<<endl<<a[0].m<<endl<<cnt;
	return 0;
}