Let the Balloon Rise(链接)
Sample Input
5 green red blue red red 3 pink orange pink 0
Sample Output
red pink
输出出现次数最多的颜色 用map存一下就好了
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
int main()
{
map<string,int> B;
string Color,Max;
int n;
while(~scanf("%d",&n)&&n!=0)
{
B.clear();
while(n--)
{
cin>>Color;
B[Color]++;
}
int max=0;
map<string,int>::iterator it; //迭代器
for(it=B.begin();it!=B.end();it++)
{
if(it->second>max)
{
max=it->second; //只能用 -> 不可以用dian点.
Max=it->first;
}
}
cout<<Max<<endl;
}
return 0;
}