初学结构体之超经典例题（有关排序）

洛谷https://www.luogu.com.cn/problem/P1093

#include<iostream>
#include<algorithm>
using namespace std;
struct stu
{
    int id;
    int chi;
    int mat;
    int eng;
    int sum;
};
int cmpchi(stu, stu);
int cmpid(stu, stu);
int cmpsum(stu x, stu y)
{
    if (x.sum > y.sum)
    {
        return 1;
    }
    else if (x.sum == y.sum)
    {
        return (cmpchi(x, y));
    }
    else
    {
        return 0;
    }
}
int cmpchi(stu x, stu y)
{
    if (x.chi > y.chi)
    {
        return 1;
    }
    else if (x.chi == y.chi)
    {
        return (cmpid(x, y));
    }
    else
    {
        return 0;
    }
}
int cmpid(stu x, stu y)
{
    if (x.id < y.id)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
int main()
{
    struct stu people[400];

    int n = 0;
    cin >> n;
    for (int i = 0; i < n; i++)
    {

        cin >> people[i].chi >> people[i].mat >> people[i].eng;
        people[i].id = i + 1;
        people[i].sum = (people[i].chi + people[i].mat + people[i].eng);
    }
    sort(people, people + n, cmpsum);
    for (int i = 0; i < 5; i++)
    {
        cout << people[i].id << ' ' << people[i].sum;
        if(i != 4)
        {
            cout << endl;
        }
    }
    return 0;
}