题解 | 成绩排序

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

//定义一个结构体
struct Student {
    string str;
    int score;
};

int main() {

    int n, k;
    while (cin >> n>>k) {
        Student student[n];
        int num = 0;
        while (num != n) {
            cin >> student[num].str >> student[num].score;
            num++;
        }
        if (k == 0) { //降序
            for (int i = 0; i < n - 1; i++) {
                for (int j = 0; j < n - i - 1; j++) {
                    if (student[j].score < student[j + 1].score) {
                        Student temp = student[j];
                        student[j] = student[j + 1];
                        student[j + 1] = temp;
                    }
                }
            }
        } else {//升序
            for (int i = 0; i < n - 1; i++) {
                for (int j = 0; j < n - i - 1; j++) {
                    if (student[j].score > student[j + 1].score) {
                        Student temp = student[j];
                        student[j] = student[j + 1];
                        student[j + 1] = temp;
                    }
                }
            }
        }
        for (int k = 0; k < n; k++) {
            cout << student[k].str << " " << student[k].score << endl;
        }
    }



}