题解 | #小白鼠排队#

#include <algorithm>
#include <iostream>
#include <cstring>
using namespace std;

struct mouse{
    int weight;
    string color;
};

bool com(mouse a,mouse b){
    return a.weight>b.weight;
}


int main() {
    int n;
    mouse mouse[100];
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>mouse[i].weight>>mouse[i].color;
    }
    sort(mouse,mouse+n,com);
    for(auto x:mouse){
        cout<<x.color<<endl;
    }
    }
// 64 位输出请用 printf("%lld")