[NOIP2007 普及组] 奖学金

小黑子¹₁⁴₅¹₄

2023-07-26 09:38:56

发布于：河北

10阅读

0回复

2点赞

快速排序，结构体排序。

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

const int MAXN = 3e2 + 5;
struct student {
    int chinese, math, english, score, id;
} a[MAXN];
int n;

bool cmp(const student &a, const student &b) {
    if (a.score != b.score) return a.score > b.score;
    else if (a.chinese != b.chinese) return a.chinese > b.chinese;
    else if (a.math != b.math) return a.math > b.math;
    else if (a.english != b.english) return a.english > b.english;
    return a.id < b.id;
}

int main() {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i].chinese >> a[i].math >> a[i].english;
        a[i].score = a[i].chinese + a[i].math + a[i].english;
        a[i].id = i;
    }

    sort(a + 1, a + 1 + n, cmp);

    for (int i = 1; i <= 5; i++) {
        cout << a[i].id << " " << a[i].score << " \n";
    }
    return 0;
}

有帮助，赞一个

去预览

0/2000

这里空空如也

热门讨论