201503-2 数字排序

#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int n;
int cnt[N];
struct Data
{
    int v, c;
    bool operator< (const Data& t) const
    {
        if (c != t.c) return c > t.c;
        return v < t.v;
    }
}q[N];
int main()
{
    cin >> n;
    while (n -- )
    {
        int x;
        cin >> x;
        cnt[x] ++ ;
    }
    n = 0;
    for (int i = 0; i < N; i ++ )
        if (cnt[i])
            q[n ++ ] = {i, cnt[i]};
    sort(q, q + n);
    for (int i = 0; i < n; i ++ )
        cout << q[i].v << ' ' << q[i].c << endl;
    return 0;
}