题解

#include<bits/stdc++.h>
using namespace std;
struct node{int c,m,e,x;};
node s[300];
bool comp(const struct node x,const struct node y){
if(x.c+x.m+x.e>y.c+y.m+y.e)return 1;
if(x.c+x.m+x.e<y.c+y.m+y.e)return 0;
if(x.c>y.c)return 1;
if(x.c<y.c)return 0;
if(x.x>y.x)return 0;
if(x.x<y.x)return 1;
}
int main(){
int k;
cin>>k;
for(int i=1;i<=k;i++){
cin>>s[i].c>>s[i].m>>s[i].e;
s[i].x=i;
}
sort(s****+1+k,comp);
for(int i=1;i<=5;i++){
cout<<s[i].x<<" ";
cout<<s[i].c+s[i].m+s[i].e<<endl;
}
}