HDU-1004 Let the Balloon Rise map的基础应用

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

 解题思路：

题意就是让你找出出现次数最多的气球的颜色

一种方法是建立一个string数组，然后进行排序，然后再来寻找次数最多的那一个

另一种方法就是使用STL里面的map，直接寻找最大数字即可

 

代码如下：

#include<bits/stdc++.h>
#define mem(a) memset(a,0,sizeof(a))
#define forn(i,n) for(int i=0;i<n;++i)
#define for1(i,n) for(int i=1;i<=n;++i)
#define IO std::ios::sync_with_stdio(false); std::cin.tie(0)
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
const int mod=10007;
const int inf=0x3f3f3f3f;

int n,m,t,k;
map<string,int> balloon;


int main()
{
    IO;
    while(cin>>n&&n)
    {
        balloon.clear();
        string str,res;
        int maxs=0;
        for1(i,n)
        {
            cin>>str;
            balloon[str]++;
            if(balloon[str]>maxs)
            {
                res=str;
                maxs=balloon[str];
            }

        }
        cout<<res<<endl;
    }
    return 0;
}