【PAT（甲级）】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, 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,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

解题思路：

题目给出N行，M列的颜色，要求你输出其中出现次数最多的颜色。又是一道数字与数字对应的题目，我们用map来存储每个数字出现的次数，再通过循环找到出现次数最多的即可。

代码：

#include
using namespace std;
int main(){
	int M,N;
	cin>>M>>N;
	map<int,int> color;//存储每种颜色出现的次数
    
	for(int i=0;i
		for(int j=0;j
			int t;
			cin>>t;
			color[t]++;
		}
	}
	
	auto tip = color.begin();//默认下标指向一开始输入的颜色
	int max = tip->second;//用来存储颜色出现最多的次数
	for(auto i = color.begin();i!=color.end();i++){
		if(i->second>max){
            tip = i;//如果出现次数最多，则替换
            max = i->second;
        }
	}
	cout<first;
	
	return 0;
}