HDU1004 Let the Balloon Rise（map的简单用法）

Let the Balloon Rise

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

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
关于map的一些用法： 
http://www.cnblogs.com/BeyondAnyTime/archive/2012/08/24/2654353.html

 #include<bits/stdc++.h>
 using namespace std;
 int main(){
     int t,max;
     string s,ms;
     map<string,int> p;
     while(cin>>t&&t!=){
         p.clear();
         for(int i=;i<t;i++){
             cin>>s;
             p[s]++;//
         }
         max=;
         map<string,int>::iterator i;
         for(i=p.begin();i!=p.end();i++){
             if(max<i->second){
                 ms=i->first;
                 max=i->second;
             }
         }
         cout<<ms<<endl;
     }
 }