HDU1004(C++map的用法)
来源:互联网 发布:unity3d制作下雨特效 编辑:程序博客网 时间:2024/05/29 01:54
Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 93577 Accepted Submission(s): 35739
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
有效利用STL可以节省代码时间。
#include <stdio.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
map<string,int>m;
int main()
{
int n;
string s,s1;
//freopen("in.txt","r",stdin);
while(scanf("%d",&n)!=EOF&&n)
{
int i,max=0;
m.clear() ;
map<string, int>::iterator it1;
for(i=0;i<n;i++)
{
cin>>s;
map<string, int>::iterator it = m.find(s);
if(it==m.end()) m.insert( make_pair(s, 1) );
else m[s]++;
}
for( map<string, int>::iterator it =m.begin(); it != m.end();it++)
{
if(max<it->second )
{
max=it->second ;
it1=it;
}
}
cout<<it1->first<<endl;
}
}
0 0
- HDU1004(C++map的用法)
- hdu1004(map的使用)
- hdu1004 (map容器的使用)
- map的应用hdu1004
- HDU1004(STL-map)
- HDU1004 Let the ballon raise(水题, 字符串的处理)(map简单用法)
- c++map的用法
- c++map的用法
- c++map的用法
- C++map的用法
- c++map的用法
- c++map的用法
- c++Map的用法
- hdu1004 map水题
- hdu1004 map,迭代器
- hdu1004(map容器)
- hdu1004 (map总结)
- hdu1004 Let the Balloon Rise && hdu1263 水果(map)
- java连接mysql插入数据操作
- laravel 让phpstorm不出现undefind类的插件
- SOJ 2749_The Fewest Coins
- angularjs自定义折线图+滑动条指令
- 计算机网络基础
- HDU1004(C++map的用法)
- appium环境搭建
- 工作计划
- 配置tnsping跟踪来诊断Oracle Net连接
- cocos2dx播放音乐
- 收藏一个Ping的小工具类,可用于网络中检测目的设备是否在线
- ubuntu下的mysql不支持中文,修改方法;
- C语言入门----输出语句
- codeforces 76A Gift 最小生成树