利用直方图统计
#include <iostream>
#include <cstdio>
using namespace std;
int colors[(1<<24)+1] = {0};
int main(){
int m, n;
scanf("%d%d", &m, &n);
int dominant = -1;
for(int j = 0; j < n; ++j){
for(int i = 0; i < m; ++i){
int num;
scanf("%d", &num);
++colors[num];
if(colors[num] > m*n/2) dominant = num;
}
}
printf("%d", dominant);
return 0;
}