HDU 5702 Solving Order

写个结构体，按数量排序，输出对应颜色。

开始怕有重复来着，觉得先不考虑那种情况，结果过了。

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<ctype.h>
#include<algorithm>
#include<deque>
#include<functional>
#include<iterator>
#include<vector>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<sstream>
#define CPY(A, B) memcpy(A, B, sizeof(A))
typedef long long LL;
typedef unsigned long long uLL;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;
const double OO = 1e20;
const double PI = acos (-1.0);
int dx[]= {0,1,1,1,0,-1,-1,-1};
int dy[]= {1,1,0,-1,-1,-1,0,1};
int gcd (const LL &a, const LL &b) {return b==0?a:gcd (b,a%b);}
using namespace std;
struct BB {
    string col; int num;
} b[110];
int cmp (BB a,BB b) {
    return a.num>b.num;
}
int main() {
    int T; scanf ("%d",&T);
    while (T--) {
        int n; scanf ("%d",&n);
        for (int i=0; i<n; ++i) {
            cin>>b[i].col;
            scanf ("%d",&b[i].num);
        }
        sort (b,b+n,cmp);
        for (int i=0; i<n; i++) {
            if (i) { cout<<" "<<b[i].col; }
            else { cout<<b[i].col; }
        }
        puts ("");
    }
    return 0;
}