90分求调

90分，#8没过

#include<bits/stdc++.h>
using namespace std;

int n;

struct data {
    int yw, sx, yy;
    int zongfen;
    int xuehao;
} a[301];

bool cmp(data a, data b) {
    if (a.zongfen > b.zongfen)
        return 1;
    else if (a.zongfen < b.zongfen)
        return 0;
    else {
        if (a.yw > b.yw)
            return 1;
        else if (a.yw < b.yw)
            return 0;
        else {
            if (a.xuehao > b.xuehao)
                return 1;
            else if (a.xuehao < b.xuehao)
                return 0;
        }
    }
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d%d%d", &a[i].yw, &a[i].sx, &a[i].yy);
        a[i].zongfen = a[i].yw + a[i].sx + a[i].yy;
        a[i].xuehao = i;
    }
    sort(a + 1, a + n + 1, cmp);
    for (int i = 1; i <= 5; i++)
        printf("%d %d\n", a[i].xuehao, a[i].zongfen);
    return 0;
}