题解

#include<bits/stdc++.h>
using namespace std;
struct pep{
    int d,v,s,e,sum;
}a[5000+10];
int n;
bool cmp(pep x,pep y){
    if(x.sum!=y.sum){
		return x.sum>y.sum;
	}
    else if(x.v!=y.v){
		return x.v>y.v;
	}
	else{
    	return x.d <y.d ;
	}
}                                       
int main(){                                                 
    cin>>n;
    for (int i=1;i<=n;i++) {
        cin>>a[i].v>>a[i].s>>a[i].e;
        a[i].d =i;
        a[i].sum=a[i].v+a[i].s+a[i].e;
    }
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=5;i++){
		cout<<a[i].d <<" "<<a[i].sum<<endl;
	}
    return 0;
}