hdoj 1004

Let the Balloon Rise

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
map<string,int> a;

#include <iostream>
#include <map>
#include <cstring>
#include <limits.h>
using namespace std;

map<string,int> a;
string temp;
int main(){
    int n;
    while(true){
        int maxn=INT_MIN;
        cin>>n;if(n==0) break;
        for(int i=1;i<=n;i++){
            long long maxn=INT_MIN;
            string s;
            cin>>s;
            a[s]++;
        }
        map<string,int>::iterator id;
        for(id=a.begin();id!=a.end();id++){
            if(id->second>maxn){
                maxn=id->second;
                temp=id->first;
           }
        }
        cout<<temp<<endl;
        a.clear();
    }
    return 0;
}

至于为什么用迭代器来计数 我也没整明白
一开始我是直接判断最大的位置 结果过不去
后来查了一下就用了迭代器访问容器
哎 烦死