HDUoj- 1004 -Let the Balloon Rise ( map

最新推荐文章于 2020-08-19 10:10:15 发布

原创最新推荐文章于 2020-08-19 10:10:15 发布 · 469 阅读

0 ·

CC 4.0 BY-SA版权

online judge HDU 同时被 2 个专栏收录

110 篇文章

订阅专栏

其他 STL

16 篇文章

订阅专栏

本篇博客介绍了一道经典的编程竞赛题目——比赛气球统计。任务是找出比赛中被最多领取的气球颜色，通过输入一系列颜色并使用C++的map结构进行计数实现。

Let the Balloon Rise

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

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

字符串统计 map练下手

#include <cstdio>
#include <cstring>
#include <string>
#include <map>
#include <algorithm>
using namespace std;

int main()
{
    int n;
    while(~scanf("%d",&n),n) {
        char str[100];
        char str_1[100];
        map<string,int> mp;
        int ans = 0;
        for(int i = 0;i < n; i++) {
            scanf("%s",str);
            mp[str]++;
            if(mp[str] > ans) {
                ans = mp[str];
                strcpy(str_1,str);
            }
        }
        puts(str_1); 
    }
return 0;
}