题解 | #小白鼠排队#

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

void xiaobaishu() {
    int n;
    cin >> n;
    vector<int> weight;
    vector<string> color;
    int in1;
    string in2;
    while (n--) {
        cin >> in1 >> in2;
        weight.push_back(in1);
        color.push_back(in2);
    }
    for (int i = 0; i < weight.size(); i++) {
        for (int j = i + 1; j < weight.size(); j++) {
            if (weight[i] < weight[j]) {
                swap(weight[i], weight[j]);
                swap(color[i], color[j]);
            }
        }
    }
    for (int i = 0; i < weight.size(); i++) {
        cout << color[i] << endl;
    }
}
int main() {
    xiaobaishu();

    return 0;
}