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

``` 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 }```

0 条评论

相关文章

Key Task Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K ...

35940

HDU 3367 Pseudoforest(Kruskal)

Pseudoforest Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/655...

30850

HDU-1054 Strategic Game(树形DP)

Strategic Game Time Limit : 20000/10000ms (Java/Other) Memory Limit : 65536/32...

34880

HDUOJ--1058HangOver

HangOver Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (...

28860

POJ 3037 Skiing(Dijkstra)

Skiing Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 4668 ...

31950

HDUOJ 1099——Lottery

Lottery Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...

37070

HDUOJ--1159Common Subsequence

Common Subsequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536...

26970

hdu 4009 Transfer water（最小型树图）

Transfer water Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/657...

37490

HDUOJ ------1398

http://acm.hdu.edu.cn/showproblem.php?pid=1398 Square Coins Time Limit: 2000/100...

28260

HDUOJ--------A simple stone game（尼姆博弈扩展)(2008北京现场赛A题）

A simple stone game                                                             ...

29050