题意:给气球的颜色,求数量最多的颜色。
分析:map乱搞
代码:
#include<stdio.h>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<vector>
#include<set>
#include<string>
#include<sstream>
#include<map>
#include<list>
#include<queue>
using namespace std;
int main(){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
//ios::sync_with_stdio(false);
int n ;
string str ;
while(~scanf("%d",&n)&&n){
map<string,int> mp ;
while(n--){
cin>>str;
mp[str]++;
}
int ans = 0 ;
map<string,int>::iterator it , it2 ;
for(it = mp.begin() ; it != mp.end(); it++){
if(it->second>ans){
ans = it->second ;
it2 = it ;
}
}
cout<<it2->first<<endl;
}
return 0 ;
}