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 }

 

目录
相关文章
STL or Force --- CSU 1553: Good subsequence
Good subsequence Problem's Link:   http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1553   Mean:  给你一个长度为n的序列和一个值k,让你找出一个子序列,满足在这个子序列中max-min的值>n>>k) { ve.
867 0
|
C++
STL --- UVA 123 Searching Quickly
UVA - 123 Searching Quickly Problem's Link:   http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=19296   Mean:  有一个字符串集合Ignore,还有一个文本集合TXT,在TXT中除了Ignore中的单词外其他的都是关键字,现在要你根据这些关键字来给TXT文本排序(根据关键字的字典)。
1111 0
|
9月前
|
Java
HDU-1004—Let the Balloon Rise
HDU-1004—Let the Balloon Rise
45 0

热门文章

最新文章