csp 201503-2 数字排序

#include<iostream>
#include<map>
#include<queue>
using namespace std;
struct node{
	int key;
	int count;
	friend bool operator <(node n1,node n2){
		if(n1.count == n2.count){
			return n1.key>n2.key;
		}
		else return n1.count <n2.count;
	}
};
int main(){
	int n;
	cin>>n;
	map <int, int> number;
	priority_queue <node> q;
	int i;
	int num;
	for(i=0;i<n;i++){
		cin>>num;
		number[num]++;
	}
	node tmp;
	for(map<int, int>::iterator it = number.begin();it!=number.end();it++){
		tmp.key = it->first;
		tmp.count = it->second;
		q.push(tmp);
	}
	while(!q.empty()){
		tmp = q.top();
		cout<<tmp.key<<" "<<tmp.count<<endl;
		q.pop();
	}
	return 0;
}