题解 | #小白鼠排队#

#include<cstdio>
#include<algorithm>
using namespace std;
struct mouse{
	int weight;
	char colour[10];
};
bool comp(mouse lhs, mouse rhs){
	if (lhs.weight > rhs.weight){
		return true;
	}
	else{
		return false;
	}
}
int main(){
	int n;
	mouse s[100];
	while (scanf("%d", &n) != EOF){
		for (int i = 0; i < n; i++){
			scanf("%d %s", &s[i].weight, &s[i].colour);
		}
		sort(s, s + n, comp);
		for (int i = 0; i < n; i++){
			printf("%s\n", s[i].colour);
		}
	}
}