hdoj 1004 Let the Balloon Rise（stl）

最新推荐文章于 2013-06-08 18:33:16 发布

hackerzchao

最新推荐文章于 2013-06-08 18:33:16 发布

阅读量1.7k

点赞数

分类专栏： ACM 文章标签： each iterator string input up

本文链接：https://blog.csdn.net/hnuzengchao/article/details/7678929

版权

ACM 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Let the Balloon Rise

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

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

Author

WU, Jiazhi

Source

ZJCPC2004

Recommend

JGShining

#include<iostream>
#include<map>
#include<string>
using namespace std;

int main()
{
	map<string,int> balloon;
	int n;
	string a;
	while(cin >> n&& n!=0)
	{
		balloon.clear();
		while(n--)
		{
			cin >> a;
			balloon[a]++;
		}
		map<string,int>::iterator it;
		int max=-100;string maxcolor;
		for (it=balloon.begin();it!=balloon.end();it++)
		{
			if((*it).second>max)
			{
				max=(*it).second;
				maxcolor=(*it).first;
			}
		}
		cout<<maxcolor<<endl;
	}
	return 0;
}

STL运用。