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

---

题目大意：

给出n*m的像素矩阵，让你找出主要的颜色，也就是找出出现的次数要大于n*m/2的那个颜色。

思路：

使用map，每遇到一种颜色就使该种颜色对应的map值自加1，遍历结束后再从map中找到值大于m*n/2的那个，输出即可。

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<queue>
using namespace std;
int m, n;
map<long long int, int> mp;
int main() {
	cin >> m >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			long long int tmp;
			scanf("%lld", &tmp);
			mp[tmp]++;
		}
	}
	for (auto it = mp.begin(); it != mp.end(); it++) {
		if (it->second > m*n / 2) {
			printf("%lld", it->first);
		}
	}
	return 0;
}