C++小作业-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.

【输入形式】

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.

【输出形式】

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.

【样例输入】

5

green

red

blue

red

red

3

pink

orange

pink

0
【样例输出】

red

pink

二、代码实现

#include
using namespace std;
#include

int main(){
        map<string,int> m;//first存储color，second存储数量
        int  t;
        string  color;
        cin>>t;
        while(t){//t=0时退出
            while(t--){
                cin>>color;//依次读入颜色
                m[color]++;//对应颜色数量加1
            }
                int  maxn=0;
                string  s;
                //迭代器遍历
                for(map<string,int>::iterator it=m.begin();it!=m.end();it++)
                {
                	if((it->second)>maxn)//it指针获取second
                	{
                		maxn=it->second;
                		s=it->first;
					}
				}
                cout<<s<<endl;
                m.clear();
                cin>>t;
        }
        return  0;
}