题解

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

struct stu {
    string name;
    int score;
    bool operator<(stu other) const {
        if (score == other.score) {
            return name < other.name;
        }
        return score > other.score;
    }
};

int main() {
    int n;
    cin >> n;

    vector<stu> students(n);
    for (int i = 0; i < n; ++i) {
        cin >> students[i].name >> students[i].score;
    }

    sort(students.begin(), students.end());

    for (stu student : students) {
        cout << student.name << " " << student.score << endl;
    }

    return 0;
}

结构体+排序，不会还没有人不会吧