solution

#include <bits/stdc++.h>
using namespace std;
struct node{
    int c;
    int m;
    int e;
    int id;
    int sum;
}a[310];
bool cmp(node a, node b){
    if(a.sum != b.sum) return a.sum > b.sum;
    else if(a.c != b.c) return a.c > b.c;
    else return a.id < b.id;
}
int main(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i].c >> a[i].m >> a[i].e;
        a[i].id = i;
        a[i].sum = a[i].c + a[i].m + a[i].e;
    }
    sort(a + 1, a + n + 1, cmp);
    for(int i = 1; i <= 5; i++){
        cout << a[i].id << ' ' << a[i].sum << endl;
    }
    return 0;
}