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, 8), 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 (≤) and N (≤) which are the resolutions of the image. Then N lines follow, each contains M digital colors in the range [0). 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来统计矩阵中出现数字的次数。

Code：

#include <bits/stdc++.h>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    map<string, int> mp;
    string str;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> str;
            mp[str]++;
        }
    }
    int maxn = -1;
    for (auto it : mp) {
        if (it.second > maxn) {
            maxn = it.second;
            str = it.first;
        }
    }
    cout << str << endl;
    return 0;
}