题目地址:http://pat.zju.edu.cn/contests/pat-a-practise/1054
此题没有怎么难的,用下map就行了。
代码如下:
//#include "StdAfx.h"
#include<stdio.h>
#include<string>
#include<map>
#include<iostream>
#include<cstring>
#include<stdlib.h>
using namespace std;
int main()
{
//freopen("D://test.txt","r",stdin);
map<char*,int> color_count;
int M,N;
scanf("%d %d",&M,&N);
int total=M*N;
int total_temp=total;
char color[20];
while(total_temp--){
int i;
scanf("%s",&color);
++color_count[color];
}
int max_count=0;
char *dominant_clor;
map<char*,int>::iterator it= color_count.begin();
for(;it!=color_count.end();++it){
if(max_count<it->second){
max_count=it->second;
dominant_clor=it->first;
if(max_count*2>total)
break;
}
}
cout<<dominant_clor<<endl;
return 0;
}