Description
Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most popular problem. When the contest is over, they will count the balloons of each color and find the result.
This year, they decide to leave this lovely job to you.
Input
Input contains multiple test cases. Each test case starts with a number N (0 < N < 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters.
A test case with N = 0 terminates the input and this test case is not to be processed.
Output
For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case.
Sample Input
5
green
red
blue
red
red
3
pink
orange
pink
0
Sample Output
red
pink
题目介绍
输入多个气球的颜色,输出数目最多的那种颜色
解题思路
统计颜色出现的个数,输出最多的那个颜色
可以将数据放到映照容器里
源代码
#include<bits/stdc++.h>
using namespace std;
int main()
{
map<string,int>m;
int n,i;
string s;
map<string,int>::iterator it,it2;
while(cin>>n)
{
if(n==0) break;
m.clear();
for(i=0;i<n;i++)
{
cin>>s;
if(m.find(s)!=m.end())
m[s]=m[s]+1;
else
m[s]=1;
}
it2=m.begin();
for(it=m.begin();it!=m.end();it++)
if(it2->second<it->second)
it2=it;
cout<<it2->first<<endl;
}
return 0;
}
stl 感觉越用越好用,但是仍然不太熟练,还需要不断的A题。