大佬们看看

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<map>
#include<queue>
#include<stack>
using namespace std;
int n;
struct oi{
	string na;
	int c,m,e,z;
}a[10005];
bool cmp(oi x,oi y)
{
	return x.z > y.z;
}
int main()
{
	cin>>n;
	for (int i = 1;i <= n;i++)
	{
		cin>>a[i].na>>a[i].c>>a[i].m>>a[i].e;
		a[i].z = a[i].c + a[i].m + a[i].e;
	}
	sort(a + 1,a + n + 1,cmp);
	cout<<a[1].na<<" "<<a[1].c<<" "<<a[1].m<<" "<<a[1].e;
 	return 0;
}