【PAT】1054 The Dominant Color (20分)（模拟 STLmap）

题目：

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, 800×600), 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​24​​). 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

题目大意：一张图片一般是由24位的像素（pixel）构成的，我们称一张图片中，同一个像素点出现超过一半的为主色；给出一张M*N个像素点的图片，求主色；

解题思路：用map存储每个像素点出现的次数，超过一半（M*N/2）就输出。注意：主色可能不止一个。所以需要在循环以内输出。

代码：

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main(){
  map<int,int> v;
  int m,n,temp;
  cin>>m>>n;
  int total=m*n;
  int max=0,maxn=0;
  for(int i=0;i<total;i++){
    scanf("%d",&temp);
    v[temp]++;

    if(v[temp]>max){
      max=v[temp];
      maxn=temp;
    }
    if(max>total/2) cout<<maxn;
  }return 0;
  
}