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.

Sample Input:

5 3
0 0 255 16777215 24
24 24 0 0 24
24 0 24 24 24

Sample Output:

24

 1 #include <stdio.h>
 2 #include <stdlib.h>
 3 #include <iostream>
 4 #include <string.h>
 5
 6 #include <math.h>
 7 #include <algorithm>
 8 #include <vector>
 9 #include <set>
10 #include <string>
11 #include <map>
12 using namespace std;
13 const int maxn=800*600+10;
14
15
16 int main(){
17    int m,n;
18    scanf("%d %d",&m,&n);
19    map<int,int> count;
20    for(int i=0;i<n;i++)
21    {
22        for(int j=0;j<m;j++)
23        {
24            int temp;
25            scanf("%d",&temp);
26          if(count.find(temp)!=count.end())
27          {
28              count[temp]++;
29          }else
30          {
31              count[temp]=1;
32          }
33        }
34    }
35   int k=0,max=0;
36   for(map<int,int>::iterator it=count.begin();it!=count.end();it++)
37   {
38       if(it->second>max)
39       {
40         k=it->first;
41         max=it->second;
42       }
43   }
44   printf("%d",k);
45     return 0;
46 }