Let the Balloon Rise HDU

Let the Balloon Rise HDU - 1004

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.

InputInput 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.
OutputFor 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

#include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
#include<string.h>
#include<map>
using namespace std;
#define INF (1<<29)
int main()
{
    int n;
    string a;
    while(~scanf("%d",&n),n)
    {
        map<string,int> mp;
        string ans;
        int no=0;
        for(int i=0;i<n;i++)
        {
            cin>>a;
            mp[a]++;
        }
        for(map<string,int>::iterator it=mp.begin();it!=mp.end();it++)
            if(no<it->second)
            {ans=it->first;no=it->second;}
        cout<<ans<<endl;
    }
    return 0;
}

stl map的题

map<string,int> mp;前面的项是颜色，后面的项是颜色的个数。输出后项即是题目答案。

map规定以前面的项来作为排序要求且不能重复。