题解

#include<iostream>
#include<cmath>
#include<cstdio>
#include<algorithm>
using namespace std;
int n;
struct awa
{
    int cn,ms,eh,all,num;
}a[305];
bool cmp(awa x,awa y)
{
    if(x.all!=y.all)
    {
        return x.all>y.all;
    }
    else if(x.cn!=y.cn)
    {
        return x.cn>y.cn;
    }
    return x.num<y.num;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i].cn>>a[i].ms>>a[i].eh;
        a[i].num=i;
        a[i].all=a[i].cn+a[i].ms+a[i].eh;
    }
    sort(a+1,a+1+n,cmp);
    for(int i=1;i<=5;i++)
    {
        cout<<a[i].num<<" "<<a[i].all<<endl;
    }
}