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,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
#include<iostream>
#include<map>
#include<algorithm>
#include<vector>
using namespace std;
typedef pair<int,int> PAIR;
bool cmp(const PAIR &k1,const PAIR &k2)
{
return k1.second>k2.second;
}
int main()
{
map<int,int> s;
s.clear();
int m,n,i,j,d,t;
cin>>m>>n;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cin>>d;
if(!s.count(d))
s.insert(make_pair(d,1));
else
s[d]++;
}
}
vector<PAIR> v(s.begin(),s.end());
sort(v.begin(),v.end(),cmp);
if(v[0].second>(m*n/2))
cout<<v[0].first<<endl;
return 0;
}
题不难。
但是,众所周知,map是非线性容器,只能对key排序,如果对value排序,必须向其他办法了。
我的办法是:
用map对象初始化vector对象。在定义一个比较函数
vector<PAIR> v(s.begin(),s.end());
sort(v.begin(),v.end(),cmp);
bool cmp(const PAIR &k1,const PAIR &k2)
{
return k1.second>k2.second;
}