zoukankan      html  css  js  c++  java
  • hdoj1004--Let the Balloon Rise

    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
     
    使用C++ STL中的map模板
    #include<iostream>
    #include<cstdio>
    #include<map>
    #include<string>
    #include<cstring>
    using namespace std;
    
    void solve()
    {
        int T, max, t;
        map<string, int> color_count;
        string color;
        while(cin>>T && T) {
            max = 0;
            while(T--) {
                cin>>color;
                ++color_count[color];
            }
            map<string, int>::const_iterator ii, it;
            it = color_count.begin();
            while(it != color_count.end()) {
                if(max < it->second) {
                    max = it->second;
                    ii = it;
                }
                it++;
            }
            cout<<ii->first<<endl;
            color_count.clear();
        }
    }
    
    int main()
    {     
        solve();
        return 0;
    }
  • 相关阅读:
    bzoj1607: [Usaco2008 Dec]Patting Heads 轻拍牛头
    bzoj1016: [JSOI2008]最小生成树计数
    bzoj1051: [HAOI2006]受欢迎的牛
    bzoj1003: [ZJOI2006]物流运输
    bzoj1079: [SCOI2008]着色方案
    bzoj1179: [Apio2009]Atm
    bzoj1877: [SDOI2009]晨跑
    bzoj1821: [JSOI2010]Group 部落划分 Group
    bzoj1305: [CQOI2009]dance跳舞
    bzoj1858: [Scoi2010]序列操作
  • 原文地址:https://www.cnblogs.com/xueda120/p/3573977.html
Copyright © 2011-2022 走看看