题解 | #小白鼠排队#

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

struct Mouse {
    int weight;
    string color;
};

bool cmp_desc(Mouse a, Mouse b) {
    return a.weight > b.weight;
}

int main() {
    const int MAXN = 100;
    int n;
    while (scanf("%d", &n) != EOF) {
        Mouse arr[n];
        for (int i = 0; i < n; ++i) {
            cin >> arr[i].weight >> arr[i].color;
        }
        sort(arr, arr + n, cmp_desc);

        for (int i = 0; i < n; ++i) {
            cout << arr[i].color << endl;
        }

    }

    return 0;
}