题解 | #小白鼠排队#

#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;
    int w[105],t;
    string color[105],tmp;
    for(int i = 0;i < n; i++)
        cin >> w[i] >> color[i];
    for(int i = 0;i < n;i++){
        int Max = w[i];
        int Maxindex = i;
        for(int j = i + 1;j < n;j++){
            if(w[j] > Max){
                Max = w[j];
                Maxindex = j;
            }
        }
        t = w[i];
        w[i] = Max;
        w[Maxindex] = t;
        tmp = color[i];
        color[i] = color[Maxindex];
        color[Maxindex] = tmp;
    }
    for(int i = 0;i < n;i++){
        cout << color[i] << endl;
    }
}