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

    Let the Balloon Rise

    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


     1 #include <iostream>
     2 #include <set>
     3 #include <string>
     4 #include <algorithm>
     5 #include <vector>
     6 #include <map>
     7 #include <stdio.h>
     8 #include <cmath>
     9 using namespace std;
    10 
    11 int main()
    12 {
    13     int n;
    14     while(cin >> n && n)
    15     {
    16         map<string,int> mp;
    17         map<string,int>::iterator it = mp.begin(), ite = mp.begin();
    18         for(int i = 0; i < n; i++)
    19         {
    20             string a;
    21             cin >> a;
    22             mp[a]++;
    23         }
    24         int m = 0;
    25         for(it = mp.begin(); it != mp.end();it++)
    26         {
    27             if((it->second) > m)
    28             {
    29                 m = (it->second);
    30                 ite = it;
    31             }
    32         }
    33         cout << (ite->first) << endl;
    34     }
    35     return 0;
    36 }


  • 相关阅读:
    startup毕业论文
    LeetCode OJ
    LeetCode OJ
    LeetCode OJ
    LeetCode OJ
    LeetCode OJ
    install
    逻辑卷(lv)管理(LVM)
    mke2fs
    cat & 文件结束符
  • 原文地址:https://www.cnblogs.com/jxust-jiege666/p/6539486.html
Copyright © 2011-2022 走看看