题解 | 小白鼠排队

#include <functional>
#include <iostream>
#include <string>
#include <map>
#include <algorithm>

using std::cout;
using std::cin;
using std::endl;
using std::map;
using std::string;

int main() {
    int N;
    cin >> N;
    string color;
    int weight;
    map<int, string, std::greater<int>> m;	// 因为是降序排序，所以使用std::greater<int>

    for (int i = 0; i < N; i++) {
        cin >> weight >> color;
        m[weight] = color;
    }
    for (auto& elem : m)
        cout << elem.second << endl;
    return 0;
}