只有3个点过了

#include<bits/stdc++.h>

using namespace std;

struct node
{
	char ch[21];
	int money;
	int num;
};

int n;
int sum, ans;
struct node a[100];

bool cmp(struct node n1, struct node n2);
 
int main()
{
	int i, j;
	int qimo;
	int banji;
	char ganbu;
	char xibu;
	int lunwen;
	
	cin >> n;
	for(i = 0; i < n; i++)
	{
		sum = 0;
		cin >> a[i].ch;
		cin >> qimo >> banji >> ganbu >> xibu >> lunwen;
		a[i].num = i;
		if(qimo > 80 && lunwen != 0)
		{
			sum += 8000;
		}
		if(qimo > 85 && banji > 80)
		{
			sum += 4000;
		}
		if(qimo > 90)
		{
			sum += 2000;
		}
		if(qimo > 85 && xibu == 'Y')
		{
			sum += 1000;
		}
		if(qimo > 80 && ganbu == 'Y')
		{
			sum += 850;
		}
		a[i].money = sum;
	}
	sort(a, a + n, cmp);
    
	for(i = 0; i < n; i++)
	{
		ans += a[i].money;
	}
    
	i = 0;
	while(a[0].ch[i] != '\0')
	{
		cout << a[0].ch[i];
		i++;
	}
	cout << endl;
	cout << a[0].money << endl;
	cout << ans << endl;
}

bool cmp(struct node n1, struct node n2)
{
	if(n1.money != n2.money)
	{
		return(n1.money > n2.money);
	}
	else
	{
		return(n1.num < n2.num);
	}
}