HDOJ 1004 map

Let the Balloon Rise

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

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

---

这题很早前做过一次。不过当时对map不是很了解也肯定没有想到用map，今天再看到这道题目。就打算用map来解决。当时应该是模仿了一个差不多的结构体吧。

#include<bits/stdc++.h>
#define max(a,b) a>b?a:b
#define min(a,b) a<b?a:b
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
map<string,int> m;
int main(){
    int n;
    while(cin>>n && n){
        string s;
        m.clear();
        for(int i = 1 ; i <= n ; i++){
            cin >> s;
            m[s]++;
        }
        ll ans = -1;
        map<string,int>::const_iterator id;
        for(id = m.begin() ; id != m.end() ; id++)
            if(id->second > ans){
                ans = id->second;
                s = id->first;
            }
        cout<<s<<endl;
    }
    return 0;
}