HDU 1004 Let the Balloon Rise

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

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

0 ·

CC 4.0 BY-SA版权

文章标签：

#HDU

AC历程专栏收录该内容

54 篇文章

订阅专栏

本文介绍了一个简单的编程问题，即统计比赛中每种颜色气球的数量，并找出最流行的气球颜色。通过使用C++中的map和algorithm库，实现了对颜色及其出现频率的记录与排序。

Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 123853 Accepted Submission(s): 48852

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

题目是旨在求出出现次数最多的颜色假定为最受欢迎，由于涉及到字符串，灵活一点的使用了string。利用STL的map类存储颜色和次数和algorithm里的max_element(）来排序。

#include<stdio.h>
#include<map>
#include<string>
#include<algorithm> 
using namespace std;
bool cmp(pair<string, int>a, pair<string, int>b)//排序的二元谓词
{
    return a.second < b.second;
}
int main()
{
    int n;
    while (scanf("%d",&n)!=EOF)
    {
        if (n == 0) continue;
        map <string, int> color;
        for (int i = 0; i < n; i++)
        {
            string color_;
            color_.resize(16);//scanf输入字符串的预先设定空间
            scanf("%s", &color_[0]);
            color[color_]++;
        }
        map<string, int>::iterator it = max_element(color.begin(), color.end(), cmp);
        puts(it->first.c_str());

    }
    return 0;
}