04 奖学金

题目：

sort排序：

#include<iostream>
#include<algorithm>
using namespace std;
#define M 100005
//int a[M];

struct person
{
    int num;
    int c,m,e;
    int sum;
}a[M];

bool cmp(person p1,person p2)
{
    if(p1.sum!=p2.sum)
    {
        return p1.sum>p2.sum;
    }
    else
    {
        if(p1.c!=p2.c)
        {
            return p1.c>p2.c;
        }
        else
        {
            return p1.num<p2.num;
        }
    }
}

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].sum=a[i].c+a[i].m+a[i].e;
        a[i].num=i;
    }
    
    sort(a+1,a+n+1,cmp);
    
    for(int i=1;i<=5;i++)
    {
        cout<<a[i].num<<" "<<a[i].sum<<endl;
    }
}