zoukankan      html  css  js  c++  java
  • hdu 1004 Let the Balloon Rise

    Let the Balloon Rise

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 102616    Accepted Submission(s): 39372


    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
     
    #include<stdio.h>
    #include<iostream>
    #include<map>
    using namespace std;
    map<string,int>m;
    int main()
    {
        int n;
        while(~scanf("%d",&n)&&n!=0)
        {
            m.clear();
            string a;
            for(int i=0;i<n;i++)
            {
                cin>>a;
                if(m.count(a))
                {
                    m[a]++;
                }
                else
                    m.insert(pair<string,int>(a,1));
            }
            int maxx=-100;
            string ans;
            map<string,int>::iterator iter;
            for(iter=m.begin(); iter!=m.end(); iter++)
            {
                if(maxx<iter->second)
                    {ans=iter->first;
                    maxx=iter->second;
                    }
            }
            cout<<ans<<endl;
        }
        return 0;
    }
    View Code
     
  • 相关阅读:
    移动网络介绍
    统一导航路由方案
    负载均衡汇总
    Openfire部署和配置说明
    CDN技术介绍
    流媒体
    WebSocket和HTTP的区别与联系
    zabbix 邮件报警
    Linux系统故障-Repair filesystem
    redhat 6.8 配置yum源
  • 原文地址:https://www.cnblogs.com/superxuezhazha/p/5460928.html
Copyright © 2011-2022 走看看