1054 The Dominant Color (20分)

最新推荐文章于 2023-12-01 11:26:18 发布

Axelrod Wayne

最新推荐文章于 2023-12-01 11:26:18 发布

阅读量98

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/zhongxinyun/article/details/107727186

版权

PAT甲级专栏收录该内容

78 篇文章 0 订阅

订阅专栏

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:

思路：读取数据的时候计数，然后去取出现次数大于一半的值即可

AC代码

#include<iostream>
#include<unordered_map>
#include<algorithm>
using namespace std;
unordered_map<string,int> ans;
int n,m;
string res;
int main()
{
    cin >> n >>m;
    string a;
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<n;j++)
        {
            cin >> a;
            ans[a]++;
        }
    }
    double k=(double)n*m/2;
    for(auto it=ans.begin();it!=ans.end();it++)
    {
        if((*it).second>k)
        {
            res=(*it).first;
            break;
        }
    }
    cout << res;
    return 0;
}