杭电oj-1004（Let the Balloon Rise）

题目链接：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

题目大意

输入字符串数量n，若n不为0则继续输入n个字符串，求出现次数最多的字符串，若n为0则退出。

解题思路

比较简单的方法是用map来存储每个字符串以及统计出现的次数，最后再求map中value值最大的元素。

代码

#include <iostream>
#include <map>
#include <algorithm>
#include <string>

using namespace std;

int main(int argc, const char * argv[]) {
    int n;
    while (cin >> n) {
        if (n == 0) {
            //退出程序
            break;
        }
        
        map<string, int> m;
        for (int i = 0; i < n; i++) {
            string temp;
            cin >> temp;
            m[temp]++;
        }
        
        //求map中value值最大的元素
        auto i = max_element(m.begin(), m.end(), [](pair<string, int> left, pair<string, int> right){
            return left.second < right.second;
        });
        
        //输出出现次数最多的字符串
        cout << i->first << endl;
    }
    
    return 0;
}

参考
c++ 中 map 的用法
c++ map：获取map中value最大值、最小值对应的键值对

个人学习经验，欢迎各位指导