50分求大佬帮助！！

#include<bits/stdc++.h>
using namespace std;
struct node
{
	int id,yw,sx,yy,zf;
}a[10005];
bool cmp(node x,node y)
{
	if(x.zf!=y.zf) return x.zf>y.zf;
	if(x.yw!=y.yw) return x.zf>y.zf;
	if(x.id!=y.id) return x.zf<y.zf;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		a[i].id=i;
		cin>>a[i].yw>>a[i].sx>>a[i].yy;
		a[i].zf=a[i].yw+a[i].sx+a[i].yy;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=5;i++)
	{
		cout<<a[i].id<<" "<<a[i].zf<<endl;
	}
	return 0;
}