题解

#include<iostream>
#include<algorithm>
using namespace std;
struct stu{
    int ch,ma,en,all,id;
}a[310];
bool cmp(stu a,stu b){
    if(a.all!=b.all){
        return a.all>b.all;
    }else if(a.ch!=b.ch){
        return a.ch>b.ch;
    }else{
        return a.id<b.id;
    }
}
int main(){
    int n;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i].ch>>a[i].ma>>a[i].en;
        a[i].all=a[i].ch+a[i].ma+a[i].en;
        a[i].id=i;
    }
    sort(a,a+n,cmp);
    for(int i=0;i<5;i++){
        cout<<a[i].id+1<<' '<<a[i].all<<'\n';
    }
    return 0;
}