hdu1004(map的使用）

第一次使用map借鉴了大佬的代码
Let the Balloon Rise

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

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 | We have carefully selected several similar problems for you: 1008 1009 1019 1021 1013

Statistic | Submit | Discuss | Note
题意：输出给出的字符串中出现的最多的串。

代码：

#include<iostream>#include<string>#include<map>using namespace std;int main(){    int max,n;    map<string,int> ball;    string d,md;    while(scanf("%d",&n),n)    {        ball.clear();        while(n--)        {            cin>>d;            ball[d]++;        }        map<string,int>::iterator t;        max=0;        for(t=ball.begin();t!=ball.end();t++)        {            if(t->second>max)            {                max=t->second;                md=t->first;            }        }        cout<<md<<endl;    }    return 0;}