HDU 1004 Let the Balloon Rise

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

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

0 ·

CC 4.0 BY-SA版权

hdu 专栏收录该内容

13 篇文章

订阅专栏

本文深入探讨了信息技术领域的各种细分技术领域，包括但不限于前端开发、后端开发、移动开发等，提供了详细的标签体系结构，并介绍了如何根据博客内容生成关键词与新标签的方法。

Letthe Balloon Rise

Time Limit: 2000/1000 MS (Java/Others) MemoryLimit: 65536/32768 K (Java/Others)
Total Submission(s): 44096 Accepted Submission(s): 15575

Problem Description

Contesttime again! How excited it is to see balloons floating around. But to tell youa secret, the judges' favorite time is guessing the most popular problem. Whenthe contest is over, they will count the balloons of each color and find theresult.

This year, they decide to leave this lovely job to you.

Input

Inputcontains multiple test cases. Each test case starts with a number N (0 < N<= 1000) -- the total number of balloons distributed. The next N linescontain one color each. The color of a balloon is a string of up to 15lower-case letters.

A test case with N = 0 terminates the input and this test case is not to beprocessed.

Output

Foreach case, print the color of balloon for the most popular problem on a singleline. It is guaranteed that there is a unique solution for each test case.

Sample Input

green

red

blue

red

pink

orange

pink

Sample Output

red

pink

Author

WU,Jiazhi

Source

ZJCPC2004

Recommend

JGShining

题目大意：输出颜色出现最多次数的颜色；

解题思路：用stl map做

/*Let the Balloon Rise HDU1004*/
#include <iostream>
#include <cstdio>
#include <map>
using namespace std;

map<string, int> m;
int main(int argc, char *argv[])
{
    int n;
    string ball;
    while(scanf("%d",&n)!=EOF,n)
    {
        int max=0;
        for(int i=0; i<n; i++)
        {
            cin>>ball;
            m[ball]+=1;
            if(max<m[ball])
                max=m[ball];        
        }
        map<string, int>::iterator it=m.begin();
        for(;it!=m.end();it++)
        {
            if(max==it->second)
                cout<<it->first<<endl;
        }
        m.clear();            
    }
    return 0;
}