1054 The Dominant Color

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, 2²⁴). 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

水题，水题，绝逼大水题。本来怕容量太大的，结果。。一点问题都没有。

#include<iostream>
#include<map>
#include<stdio.h>
using namespace std;
int main(){
	for(int n,m;scanf("%d%d",&n,&m)!=EOF;){
		map<int,int>sence;
		for(int i = 0;i < n; i++){
			for(int j = 0;j < m;j++){
				int temp;
				scanf("%d",&temp);
				sence[temp]++;
			}
		}
		map<int,int>::iterator iter ;
		int max = 0;
		int max_num = 0;
		for(iter = sence.begin();iter != sence.end();iter++){
			if(iter->second > max){
				max = iter->second;
				max_num = iter->first;
			}
		}
		printf("%d\n",max_num);
	}
	return 0;
}