标签：c++
http://blog.csdn.net/pipisorry/article/details/39434403
输入的第一行只有一个正整数n(1 ≤ n ≤ 1000)，表示数字的个数。
输入的第二行有n个整数s1, s2, …, sn (1 ≤ si ≤ 10000, 1 ≤ i ≤ n)。相邻的数用空格分隔。
6
10 1 10 20 30 20
10
code:
/****************************************************************************/
/* CCF软件能力认证考试模拟题 —— 出现次数最多的数 皮皮 2014-8-30 */
/****************************************************************************/
#include <assert.h>
#include <iostream>
#include <map>
using namespace std;
int main(){
//assert( freopen("CCF\\mostOftenNum.in", "r", stdin) );
int n, num;
typedef map<int, int> intIntMap;
intIntMap numCount;
cin>>n;
for(int i = 0; i < n; i++){
cin>>num;
numCount[num]++;
}
int max_num = INT_MIN, max = -1;
for(intIntMap::iterator pos = numCount.begin(); pos != numCount.end(); pos++){
//cout<<pos->first << " : " << pos->second << endl;
if( pos->second > max || (pos->second == max && pos->first < max_num)){
max = pos->second;
max_num = pos->first;
}
}
cout<< max_num << endl;
//fclose(stdin);
return 0;
}
from:http://blog.csdn.net/pipisorry/article/details/39434403
标签：c++
原文地址：http://blog.csdn.net/pipisorry/article/details/39434403
