Let the Balloon Rise
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 184994 Accepted Submission(s): 74000
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 themost popular problem. When the contest is over, they will count theballoons 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才1000暴力循环吧!!!
#include<bits/stdc++.h>
using namespace std;
int main(){
int count = 0;
string colors;
while(cin >> count){
map<string ,int>mapint;
if(count){
for(int i = 0; i < count; i++){
cin >> colors;
if(mapint.find(colors) == mapint.end()) mapint[colors] = 1;
else mapint[colors] = mapint[colors] + 1;
}
int mmax = 0;
for( std::map<string, int>::iterator iter = mapint.begin();iter != mapint.end(); ++ iter ){
if(mmax < iter->second){
mmax = iter->second;
colors = iter->first;
}
}
cout << colors <<endl;
}
else if(count==0) break;
}
return 0;
}