题解 | #小白鼠排队#
小白鼠排队
http://www.nowcoder.com/practice/27fbaa6c7b2e419bbf4de8ba60cf372b
#include<iostream>
#include<cstdio>
#include<string>
#include<algorithm>
using namespace std;
struct Mouse{
int weight;
string color;
};
bool Descend(Mouse a,Mouse b){
return a.weight>b.weight;
}
int main(){
int n;
Mouse array[100];
while(scanf("%d\n",&n)!=EOF){
for(int i=0;i<n;++i){
cin>>array[i].weight>>array[i].color;
}
sort(array,array+n,Descend);
for(int i=0;i<n;++i){
cout<<array[i].color<<endl;
}
}
return 0;
}
