题解

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
int a,b,c,t;
int idx;
}s[305];
int n;
bool cmp(node s1,node s2){
if(s1.t==s2.t) return s1.a>s2.a;
return s1.t>s2.t;
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>s[i].a>>s[i].b>>s[i].c;
s[i].t=s[i].a+s[i].b+s[i].c;
s[i].idx=i;
}
stable_sort(s****+1+n,cmp);
for(int i=1;i<=5;i++){
cout<<s[i].idx<<" "<<s[i].t<<endl;
}
return 0;
}