#include <cstdio>
#include <algorithm>
using namespace std;
int n;
struct sch{
    int a,b,c,sum,num;
}score[305];
bool cmp(sch p,sch q){
    if (p.sum>q.sum) return p.sum<q.sum;
    else if (p.a>q.a) return p.a<q.a;
    else if (p.num>q.sum) return p.num<q.num;
    else return q.num<p.num;
}
int main (){
    scanf ("%d",&n);
    for (int i=1;i<=n;i++)
        {
            scanf ("%d%d%d",&score[i].a,&score[i].b,&score[i].c);
            score[i].sum=score[i].a+score[i].b+score[i].c;
            score[i].num=i;
        }
    sort (score+1,score+n+1,cmp);
    for (int i=n;i>n-5;i--){
        printf("%d %d\n",score[i].num,score[i].sum);
    }
    return 0;
}

样例过了，可是0蛋，请教各位大佬。