HDU 1004 Let the Balloon Rise【STL<map>】

简介: Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 123800    Accepted Submi...

Let the Balloon Rise

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


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
分析:STL大法好啊,本题要求最大的气球数,可以用到STL标准库中的map<string,int>来保存,当map的first插入一个string的时候,map的second++,就可以统计出具体的string的个数了,然后遍历找到最大值就可以了!
下面给出AC代码:
 1 #include <bits/stdc++.h>
 2 using namespace std;
 3 int main()
 4 {
 5     map<string,int>ballon;
 6     int n;
 7     string str;
 8     while(cin>>n&&n)
 9     {
10         ballon.clear();
11         while(n--)
12         {
13             cin>>str;
14             ballon[str]++;
15         }
16         int maxn=0;
17         string maxcolor;
18         map<string,int>::iterator it;
19         for(it=ballon.begin();it!=ballon.end();it++)
20         {
21             if(it->second>maxn)
22             {
23                 maxn=(*it).second;
24                 maxcolor=(*it).first;
25             }
26         }
27         cout<<maxcolor<<endl;
28     }
29     return 0;
30 }

 

目录
相关文章
|
6月前
codeforces 317 A Perfect Pair
我先排除了输出-1的,然后再考虑如何计算最小的步数。我们主要在每一步中最小一个加上另一个就可以了,这是朴素的求法,但可能出现这样的情况 比如 -100000000 1 10000000 这样的话会循环100000000多次,肯定超时,所以我们要加快速度。
21 0
|
8月前
UVa11296 - Counting Solutions to an Integral Equation(枚举技巧)
UVa11296 - Counting Solutions to an Integral Equation(枚举技巧)
32 0
|
人工智能 BI
CodeForces - 1485D Multiples and Power Differences (构造+lcm)
CodeForces - 1485D Multiples and Power Differences (构造+lcm)
58 0
|
Perl
AtCoder Beginner Contest 217 F - Make Pair (区间dp)
AtCoder Beginner Contest 217 F - Make Pair (区间dp)
94 0
|
人工智能 vr&ar
Atcoder--Candy Distribution II--前缀和+map
题目描述 There are N boxes arranged in a row from left to right. The i-th box from the left contains Ai candies. You will take out the candies from some consecutive boxes and distribute them evenly to M children. Such being the case, find the number of the pairs (l,r) that satisfy the following:
77 0
|
机器学习/深度学习
HDU-2680,Choose the best route(Dijkstra)
HDU-2680,Choose the best route(Dijkstra)
Leetcode-Easy 141. Linked List Cycle
Leetcode-Easy 141. Linked List Cycle
72 0
Leetcode-Easy 141. Linked List Cycle
HDU-1004 Let the Balloon Rise
HDU-1004 Let the Balloon Rise