A[1054] The Dominant Colour
用到了map
#include <cstdio>
#include <map>
using namespace std;
int main(){
int n,m,num;
scanf("%d%d",&n,&m);
map<int,int>count;//数字与出现次数的映射,注意map的括号<>
for(int i=0;i<m;i++){
for(int j=0;j<n;j++){
scanf("%d",&num);
if(count.find(num)!=count.end())count[num]++;//注意此处的count括号[]
else count[num]=1;
}
}
int max=0,k=0;//记录最大数字和该数字出现的次数
for(map<int,int>::iterator it=count.begin();it!=count.end();it++){//注意
if(it->second > k){
k=it->second;
max=it->first;
}
}
printf("%d\n",max);
return 0 ;
}