《算法笔记》codeup_100000581_F

思路：

使用sort()

解答：

#include <cstdio>
#include <algorithm>
using namespace std;

struct mouse
{
    int weight;
    char color[10];
};

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

int main() {
    int mouse_num;
    while(scanf("%d", &mouse_num) != EOF) {
        mouse mouse_arr[mouse_num];
        for(int i = 0; i <= mouse_num - 1; i++) {
            scanf("%d %s", &mouse_arr[i].weight, mouse_arr[i].color);
        }

        sort(mouse_arr, mouse_arr + mouse_num, cmp);

        for(int i = 0; i <= mouse_num - 1; i++) {
            printf("%s\n", mouse_arr[i].color);
        }
    }

    return 0;
}