PAT A1054. The Dominant Color (20)

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.

5 30 0 255 16777215 2424 24 0 0 2424 0 24 24 24Sample Output:
24
#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <string>#include <map>#define Max 51using namespace std;map<int ,int>S;int main(){	int n,m;int mm;	scanf("%d%d",&n,&m);	for(int i=0;i<n;i++)	{		for(int j=0;j<m;j++)		{						scanf("%d",&mm);			if(S.find(mm)!=S.end()) S[mm]++;			else S[mm]=1;		}	}	int k;	mm=0;	for(map<int ,int >::iterator it = S.begin();it!=S.end();it++)	{		if(it->second>mm)		{			k=it->first;			mm=it->second;		}	}	printf("%d/n",k);	system("pause");	return 0;}