首页 > 代码库 > Let the Balloon Rise map一个数组
Let the Balloon Rise map一个数组
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.
InputInput 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.
OutputFor 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
5greenredblueredred3pinkorangepink0Sample Output
redpink
代码：
#include <iostream>#include <cstdio>#include <queue>#include <map>using namespace std;int main(){ int n; string a,max="a"; map<string,int> b; while(scanf("%d",&n)&&n) { b[max]=0; for(int i=1;i<=n;i++) { cin>>a; b[a]++; if(b[a]>b[max])max=a; } cout<<max<<endl; }}
Let the Balloon Rise map一个数组
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。