PAT甲1054Map的使用

PATA1054

1054 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, 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

题意：输出支配颜色，即哪种元素出现最多次数，即为支配色。

题解：map一套解决。

坑点：pat会卡输入输出。所以用scanf,printf 替换cin，cout即可

代码：

#include<iostream>
#include<map>
using namespace std;
int n,m,t;
map<int,int> mp;
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			scanf("%d",&t);
			mp[t]++;
		}
	}
	int ans1,ans2=0;
	for(map<int,int>::iterator it=mp.begin();it!=mp.end();it++)
	{
		if(it->second>ans2)
		{
			ans2=it->second;
			ans1=it->first;
		}
	}
	cout<<ans1<<endl;
	return 0;
}