Problem 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.
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.
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
Author
WU, Jiazhi
Source
题目大意:
就是先输入需要输入的颜色个数,然后把每一个颜色的名字输入进去,最终输出相同颜色最多的那个颜色名称。
解题思路:
本次题目使用了C++语言STL中的map方法,通过利用map中天生的排序规则,统计相同字符串的个数,并输出其最大值显得非常轻松,这需要熟练掌握map的基本概念和基本操作,才能更好地理解每一步程序的作用和意义
#include <stdio.h>
#include <string>
#include <iostream>
#include <map>
using namespace std;
int main()
{
int n;
string ballon;//字符串ballon
while(cin >> n,n) //输入n个颜色的字符串
{
map<string, int> m; //map的设置
int N=n; //
while(N--)
{
cin >> ballon;//输入颜色字符串循环输入
++m[ballon]; //int中的计数
}
map<string,int>::iterator p;//设置一个迭代器
int maxx=0; //最大值先设为0;
string max_ballon; //设置存放出现次数最多的字符串
for(p=m.begin(); p!=m.end(); ++p) //遍历
{
if(p->second>maxx)
{
maxx=p->second;
max_ballon=p->first;
}
}
cout << max_ballon << endl;
}
return 0;
}