Let the Balloon Rise

序言
此篇博客作为自己的学习笔记，同时欢迎大家交流！

Let the Balloon Rise

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<iostream>
#include<cstring>
#include<algorithm>//前面三个头文件 每次习惯输入
 #include<map>//map容器头文件

using namespace std;

string s,ans;//s作为map的key 的输入，ans作为标记最多的key
map<string,int>ss;//声明
int main()
{
	int n;
    while(cin>>n){
	if(n==0)break;//n==0,结束
	int max=-1;//最大值肯定大于0，声明-1，可以
	ss.clear();//清空map容器
	for(int i=0;i<n;i++)
	{
		cin>>s;//输入key
		ss[s]++;//所对应value加1
		if(ss[s]>max){
	    ans=s;	
		max=ss[s];
	}//统计标记的惯用法
	}
		cout<<ans<<endl;//输出相对应的颜色
}
	return 0;
	
}