HDU 1004 Let the Balloon Rise (map使用)
来源:互联网 发布:crt如何ping端口 编辑:程序博客网 时间:2024/05/17 22:52
分析:题意简单,就用map的知识即可
#include <stdio.h>#include <iostream>#include <string.h>#include <map>using namespace std;int main() {int i,a,b,k;int N;char num[10]; while (~scanf("%d",&N)) {map<string,int> mp; while (N--) {scanf("%s",num);mp[num]++; }map<string,int>::iterator iter;int max=-1;for (iter=mp.begin();iter != mp.end();iter++){if (iter->second > max){max=iter->second;}}for (iter=mp.begin();iter != mp.end();iter++){if (max==iter->second){cout<<iter->first<<endl;break;}} }return 0;}
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 87130 Accepted Submission(s): 32907
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.
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.
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
5greenredblueredred3pinkorangepink0
Sample Output
redpink
Author
WU, Jiazhi
Source
ZJCPC2004
2015-10-17
#include <iostream>#include <string>#include <map>using namespace std;int main(){int t;int num;int max; string s;string smax;while(cin>>t,t){ max = 0; map<string , int> m; while(t--) { cin>>s; m[s]++; if(m[s] > max) { max = m[s]; smax = s; } } cout<<smax<<endl; }return 0;}
0 0
- HDU 1004 Let the Balloon Rise (map使用)
- HDU 1004 Let the Balloon Rise (map使用)
- HDU 1004 Let the Balloon Rise【Map】
- hdu 1004 Let the Balloon Rise map
- HDU 1004 Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise map
- HDU 1004 Let the Balloon Rise(Map)
- HDU-#1004 Let the Balloon Rise(字符串+map)
- HDU 1004 Let the Balloon Rise(STL之map)
- 【hdu 1004】Let the Balloon Rise(map)
- HDU 1004 Let the Balloon Rise(map)
- Hdu oj 1004 Let the Balloon Rise(map)
- HDU 1004(map) Let the Balloon Rise
- HDU(1004)Let the Balloon Rise
- hdu 1004 Let the Balloon Rise(map的使用1)
- hdu 1004 Let the Balloon Rise map的应用
- 【map热手题】HDU 1004—Let the Balloon Rise
- HDU 1004 Let the Balloon Rise Map的应用
- 堆排序
- Project Euler:Problem 23 Non-abundant sums
- 第五章t1
- ios动画学习(二)
- 手动给帮助类打 jar包 和 给Web项目打 war包
- HDU 1004 Let the Balloon Rise (map使用)
- 如何对IP地址进行排序?
- Oracle之内存结构(SGA、PGA)
- C5.0算法学习
- Project Euler:Problem 24 Lexicographic permutations
- 长沙甲壳虫教育 留学
- 第五章t2
- 努力去前进 让自己进步
- apache 无法访问根目录下的子目录——(笔记)