90分求调！

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