2013-12-1 出现次数最多的数

Posted on | In |

思路

map stl
使用参考

http://mropengate.blogspot.com/2015/12/cc-map-stl.html

https://blog.csdn.net/shuzfan/article/details/53115922#21-%E4%BD%BF%E7%94%A8-%E8%BF%9B%E8%A1%8C%E5%8D%95%E4%B8%AA%E6%8F%92%E5%85%A5

代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
#include<iostream>
#include<map>
#define ll long long
int a[10000];
using namespace std;
int main(){
	map<int,int> m;
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i];
	if(!m.count(a[i])) m[a[i]]=1;
	else m[a[i]]++;
	} 
	int k=0;
	int ans;
	for(map<int,int>::iterator t=m.begin();t!=m.end();t++ ){
		if(t->second>k){
			ans=t->first;
			k=t->second;
		}
		else if(t->second==k){
			if(t->first<ans) ans=t->first;
		} 
	}
		cout<<ans<<endl;
}