HDU 1004 Let the Balloon Rise 【map】

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1004

思路：利用map中<string,int>分别存储颜色(color)和同种颜色的个数(num)，建立好键值之间的关系。代码如下：

#include<iostream>
#include<algorithm>
#include<map>
using namespace std;
int main(){
	int n;
	map<string,int>ma; 
	while(cin>>n&&n){
		string color,color1;
		int num,ans=0;
		for(int i=0;i<n;i++){
			cin>>color;
			ma[color]++;
			if(ma[color]>ans){
				ans=ma[color];
				color1=color;
			}
		}
		cout<<color1<<endl;
		ma.clear();  //每次使用完之后记着要清空
	}
	return 0;
}

ps:今天不能负了自己。

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

 

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