WA on #1 , 90pts求条

#include <iostream>
#include <algorithm>
using namespace std;
int n;
struct node {
	string name;
	int chinese , maths , english , total;
}a[1010];
bool cmp(node x , node y) {
	return x.total > y.total;
}
int main() {
	scanf("%d" , &n);
	for (int i = 1 ; i <= n ; i++) {
		cin >> a[i].name >> a[i].chinese >> a[i].maths >> a[i].english;
		a[i].total = a[i].chinese + a[i].maths + a[i].english;
	}
	sort(a + 1 , a + n + 1 , cmp);
	cout << a[1].name << " " << a[1].chinese << " " << a[1].maths << " " << a[1].english;
	return 0;
}