AC 题解

#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
    int maths,chinese,english,sum,id;
}a[400];
bool cmp(node a,node b){
    if(a.sum!=b.sum){
        return a.sum>b.sum;
    }
    else if(a.chinese!=b.chinese){
        return a.chinese>b.chinese;
    }
    else{
        return a.id<b.id;
    }
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].chinese>>a[i].english>>a[i].maths;
        a[i].sum=a[i].chinese+a[i].english+a[i].maths;
        a[i].id=i;
    }
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=5;i++){
        cout<<a[i].id<<' '<<a[i].sum<<endl;
    }
    return 0;
}*太简单了*