Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 58555 Accepted Submission(s): 21498
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
用map，簡單易懂
#include<iostream><map><> (cin>><, >(n-->>++<, >::const_iterator it = counters.begin(),j = (;it != counters.end(); ++(it->second > j->=<<j->first<<
在討論區裡看到有人用了clear(),不知效率會不會高一些，大神鑒定一下，代碼大概是這樣（ac了的）
#include<iostream><map><> <, >(cin>> max = (n-->>++(counters[s] >=<, >::const_iterator it = (;it != counters.end(); ++(it->second ==<<it->first<<
