201312-1-出现次数最多的数-CCF

解题思路:简单模拟，

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N=10005;
struct node
{
	int v;
	int num;
}a[N];
int cmp(node b,node c){
	if(b.num>c.num)return true;
	else if(b.num==c.num){
		if(b.v<c.v)return true;
		else return false;
	}
	return false;
}
int main(){
	int n;
	int v;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>v;
		a[v].v=v;
		a[v].num++;
	}
	sort(a,a+N,cmp);
	cout<<a[0].v<<endl;
	return 0;
}