PAT A1054

Behind the scenes in the computer’s memory, color is always talked about as a series of 24 bits of information for each pixel. In an image, the color with the largest proportional area is called the dominant color. A strictly dominant color takes more than half of the total area. Now given an image of resolution M by N (for example, 800x600), you are supposed to point out the strictly dominant color.

Input Specification:

Each input file contains one test case. For each case, the first line contains 2 positive numbers: M (<=800) and N (<=600) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0, 224). It is guaranteed that the strictly dominant color exists for each input image. All the numbers in a line are separated by a space.

Output Specification:

For each test case, simply print the dominant color in a line.

Sample Input:
5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24
Sample Output:
24

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
28
29
30
31
32
33
34
35
36
37
#include "stdio.h"
//#include "math.h"
#include "string.h"
#include "iostream"
//#include "stdlib.h"
#include "algorithm"
//#include "vector"
//#include "set"
#include "map"
using namespace std;
//typedef long long LL;


int main(){
int n, m, col;
scanf("%d%d", &n, &m);//行与列
map<int, int> count;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
scanf("%d", &col);//输入数字
if (count.find(col) != count.end()) {
count[col]++;//若已存在,则次数+1
}else{
count[col] = 1;//若不存在,次数为1
}
}
}
int k = 0, Max = 0;//最大的数字及该数字出现的次数
for (map<int,int>::iterator it = count.begin(); it != count.end(); it++) {
if (it->second > Max) {
Max = it -> second;
k = it -> first;
}
}
printf("%d\n", k);
return 0;
}