本蒟蒻在线急等

为什么第一个点RE了~

#include<bits/stdc++.h>
using namespace std;
struct student {
	string s;
	int yw, sx, yy, id, zf;

} a[1001];
int best(int a, int b[]) {
	int flag = b[1];
	int ID = 1;
	for (int i = 1; i <= a; i++) {
		if (flag < b[i]) {
			flag = b[i];
			ID = i;
		}

	}
	return ID;
}
int main() {
	//with good luck
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].s >> a[i].yw >> a[i].sx >> a[i].yy;
		a[i].zf = a[i].yw + a[i].sx + a[i].yy;
		a[i].id = i;
	}
	int flag, ID;
	for (int i = 1; i <= n; i++) {
		if (flag < a[i].zf) {
			flag = a[i].zf;
			ID = i;
		}
	}
	cout << a[ID].s << " " << a[ID].yw << " " << a[ID].sx << " " << a[ID].yy;
	return 0;
}