題目
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.
simpleInput
5
green
red
blue
red
red
3
pink
orange
pink
0
simpleOutput
red
pink
題解
使用map，關聯數組的應用，構造函數，map<string,int>關聯數組，key，string類型。value，int類型。用顏色的string類型，如“red，green”等做key。而，該顏色出現的次數做value。
代碼如下：
#include<iostream>
#include<stdio.h>
#include<string>
#include<cstring>
#include<map>
#include<iterator>
using namespace std;
int main()
{
map<string,int> ballon;
int N,i,max;
string str,maxstr;
while(~scanf("%d",&N)&&(N!=0)){
ballon.clear();
for(i=1;i<=N;i++){
cin>>str;
ballon[str]++;
//遇到key值不同的，創建一個新的map元素，
//遇到一個key值相同的，在該key的元素value加一
}
map<string,int>::iterator itr;
//迭代器遍歷
max=0;
for(itr=ballon.begin();itr!=ballon.end();itr++){
if(max<(itr->second)){
max=(itr->second);
maxstr=(itr->first);
//尋找value最大的數
}}
cout<<maxstr<<endl;
}
}