CCF CSP201503-2数字排序(c++100)

CCF CSP201503-2数字排序

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1010;
struct Node{
	int number,num;
}node[maxn];
bool cmp(Node a,Node b){
	if(a.num == b.num) return a.number < b.number;
	return a.num > b.num;
}
int main(){
	int n;
	cin>>n;
	for(int i = 0; i < n; i++){
		int m;
		cin>>m;
		node[m].num++;
		node[m].number = m;
	}
	sort(node,node+maxn,cmp);
	for(int i = 0; i < n && node[i].num!=0; i++){
		cout<<node[i].number<<" "<<node[i].num<<endl;
	}
	return 0;
}