附代码

#include<iostream>
#include<algorithm>
using namespace std;
int n;
struct xue{
	int yu,shu,ying;
	int hao;
	int sum;
}a[301];
bool cmp(xue x,xue y){
	if(x.sum!=y.sum) return x.sum>y.sum;
	else if(x.sum==y.sum) return x.yu>y.yu;
	else if(x.sum==y.sum&&x.yu==y.yu) return x.hao<y.hao;
}
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].yu>>a[i].shu>>a[i].ying;
		a[i].sum+=a[i].yu+a[i].shu+a[i].ying;
		a[i].hao=i;
	}
	sort(a+1,a+n+1,cmp);
	for(int i=1;i<=5;i++){
		cout<<a[i].hao<<" "<<a[i].sum<<endl;
	}
	return 0;
}