CCF_201503-2_数字排序

自己写个排序的cmp。

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

struct  point{
    int num,counts;
}a[];

bool cmp(point x,point y)
{
    if(x.counts == y.counts)    return x.num < y.num;
    return x.counts > y.counts;
}

int main()
{
    int n,all = ;
    cin >> n;
    for(int i = ;i <= ;i++)
    {
        a[i].num = i;
        a[i].counts = ;
    }
    int temp;
    while(n--)
    {
        cin >> temp;
        if(!a[temp].counts)    all++;
        a[temp].counts++;
    }
    sort(a,a+,cmp);
    for(int i = ;i < all;i++) cout << a[i].num << ' ' << a[i].counts << endl;
    return ;
}