AcWing每日一题--奖学金

考察排序。

https://www.acwing.com/problem/content/431/

#include<iostream>
#include<algorithm>
using namespace std;
const int N=310;
struct node{
    int a,b,c;
    int sum;
    int id;
};
node s[N];
bool cmp(node a,node b){
    if(a.sum==b.sum&&a.a==b.a){
        return a.id<b.id;
    }
    if(a.sum==b.sum){
        return a.a>b.a;
    }
    return a.sum>b.sum;
}
int main(void){
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>s[i].a>>s[i].b>>s[i].c;
        s[i].sum=s[i].a+s[i].b+s[i].c;
        s[i].id=i;
    }
    sort(s+1,s+n+1,cmp);
    for(int i=1;i<=5;i++){
        cout<<s[i].id<<" "<<s[i].sum<<endl;
    }
    return 0;
}