【Let the Balloon Rise 「map」】

最新推荐文章于 2024-09-27 11:26:03 发布

武帝为此

最新推荐文章于 2024-09-27 11:26:03 发布

阅读量74

点赞数

分类专栏： cg 文章标签： c++

本文链接：https://blog.csdn.net/qq_66726657/article/details/130587292

版权

cg 专栏收录该内容

50 篇文章 34 订阅

订阅专栏

程序需要处理多个测试用例，每个用例包含不同颜色的气球数量。对每个用例，读取并统计每种颜色的气球，找到出现次数最多的颜色并输出。当输入的气球总数为0时，表示结束。示例中，红色和粉色分别是两个测试用例中最受欢迎的颜色。

摘要由CSDN通过智能技术生成

【问题描述】

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

【输出形式】

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.

【样例输入】

green

red

blue

red

pink

orange

pink

0
【样例输出】

red

pink

【样例说明】
【评分标准】

代码如下：

#include<bits/stdc++.h>

using namespace std;

int main()
{
    map<string, int> m;
    int t;
    string color;
    cin >> t;
    while (t)
    {
        while (t--)
        {
            cin >> color;
            m[color]++;
        }
        int maxn = 0;
        string s;
        for (auto it = m.begin(); it != m.end(); ++it)
        {
            if (it->second > maxn)
            {
                maxn = it->second;
                s = it->first;
            }
        }

        cout << s << endl;
        m.clear();
        cin >> t;
    }
    return 0;
}