一直RE什么鬼。。。。。。。。。。。。。

#include<iostream>
#include<cstdio>
//#include<bits/stdc++.h>
#include<string.h>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
typedef struct student
{
	char name[21];
	int qiping, banping;
	char xuegan, xibu;
	int lunwen;
	int jiangjin;
}k;
int main()
{
	k q[11];
	int n, i, f = 0, e = 0, p = 0;
	scanf("%d", &n);
	for (i = 0; i < n; i++)
	{
		scanf("%s%d%d %c %c %d", q[i].name,//注意空格！！！！
			&q[i].qiping, &q[i].banping, &q[i].xuegan,
			&q[i].xibu, &q[i].lunwen);
		q[i].jiangjin = 0;
	}
	for (i = 0; i<n; i++)
	{
		if (q[i].qiping>80 && q[i].lunwen >= 1)
			q[i].jiangjin += 8000;
		if (q[i].qiping > 85 && q[i].banping > 80)
			q[i].jiangjin += 4000;
		if (q[i].qiping > 85 && q[i].xibu == 'Y')
			q[i].jiangjin += 1000;
		if (q[i].qiping > 90)
			q[i].jiangjin += 2000;
		if (q[i].banping > 80 && q[i].xuegan == 'Y')
			q[i].jiangjin += 850;
		p += q[i].jiangjin;
	}
	f = 0;
	for (i = 0; i < n; i++)
	{

		if (q[i].jiangjin>f)
		{
			f = q[i].jiangjin;
			e = i;
		}
	}
	printf("%s\n%d\n%d\n", q[e].name, q[e].jiangjin, p);
	return 0;
}