标签：roc -- ber float std fir NPU most ==
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
代码（map）
1 #include<iostream> 2 #include<string> 3 #include<map> 4 #include<cstdio> 5 using namespace std; 6 map<string,int>m; 7 int main(){ 8 int n; 9 string ss; 10 while(cin>>n,n){ 11 // if(n==0) break; 12 // else{ 13 while(n--){ 14 cin>>ss; 15 m[ss]++; 16 } 17 int max=0; 18 string maxstring=""; 19 map<string,int >::iterator it; 20 for(it=m.begin();it!=m.end();it++){ 21 if(it->second>max){ 22 max=it->second; 23 maxstring=it->first; 24 } 25 } 26 cout<<maxstring<<endl; 27 m.clear(); 28 // } 29 } 30 }
标签：roc -- ber float std fir NPU most ==
原文地址：https://www.cnblogs.com/-happy-/p/12257364.html
