Let the Balloon Rise

最新推荐文章于 2019-08-08 16:00:33 发布

原创最新推荐文章于 2019-08-08 16:00:33 发布 · 128 阅读

0 ·

CC 4.0 BY-SA版权

C程序无错专栏收录该内容

10 篇文章

订阅专栏

这是一个关于比赛气球统计的问题，需要找出出现次数最多的气球颜色。使用C++编程语言，通过标准输入读取每种颜色的气球数量，并利用map数据结构进行计数，最后输出出现次数最多的颜色。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 146420 Accepted Submission(s): 58127

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.

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

题意：输出出现次数最多的颜色。

AC代码：

#include<cstdio>
#include<iostream>
#include<map>
#include<string>
using namespace std;
int main()
{
	map<string,int> b;
	int n;
	while(~scanf("%d",&n)&&n)
	{
		b.clear();
		string c;
		for(int i=0;i<n;i++)
		{
			cin>>c;b[c]++;
		}
		map<string,int>::iterator it;
		int max=0;string maxc;
		for(it=b.begin();it!=b.end();it++)
		{
			if(it->second>max)
			{
				max=(*it).second;
				maxc=(*it).first;
			}
		}
		cout<<maxc<<endl;
	}
	
}