HDU 1004 Let the Balloon Rise(map)

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 

题意就是统计啥颜色气球最多输出那个颜色。

STL-map学习地址：http://blog.csdn.net/hoaresky1998/article/details/50626246

代码如下：

博客已搬： 洪学林博客