HDU 1004 Let the Balloon Rise

最新推荐文章于 2021-06-24 22:53:24 发布

原创最新推荐文章于 2021-06-24 22:53:24 发布 · 220 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#HDU

HDU 专栏收录该内容

11 篇文章

订阅专栏

本篇博客介绍了一道关于统计竞赛中各种颜色气球出现次数的编程题。通过使用C++和标准模板库(map)，实现了一个高效算法来找出最热门的问题所对应的气球颜色。

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

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

#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<map>
using namespace std;
map<string, int>mp;
map<string, int>::iterator iter;
int main()
{
    int n;
    string str;
    while (cin >> n&&n)
    {
        mp.clear();
        for (int i = 0; i < n; i++)
        {
            cin >> str;
            mp[str]++;
        }
        int res = 0;
        string ans;
        for (iter = mp.begin(); iter != mp.end(); iter++)
        {
            if (iter->second>res)
            {
                res = iter->second;
                ans = iter->first;
            }
        }
        cout << ans << endl;
    }
    return 0;
}