如题

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct node{
	int xh,yw,ss,yy,zf;
}a[1001];
bool cmp(node a,node b){
	return a.zf>b.zf;
	if(a.zf==b.zf) return a.yw>b.yw;
	if(a.zf==b.zf&&a.yw>b.yw) return a.xh<b.xh;
}
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].yw>>a[i].ss>>a[i].yy;
		a[i].xh=i;
		a[i].zf=a[i].yw+a[i].ss+a[i].yy;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=5;i++){
		cout<<a[i].xh<<" "<<a[i].zf<<endl;
	}
	cout<<endl;
	return 0;
}