hdu1004

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

 

 

此题我用了map   我做一些关于map的用法总结

map<string,int>::iterator j;
for (j=color.begin();j!=color.end();++j)
这个是遍历map的方法
map的初始化问题我还没找到解决的方法  于是此题讲其值直接改为零  找到方法之后我来更新

 

 //
 //  main.cpp
 //  hdu1004
 //
 //  Created by tupeihui on 15/12/6.
 //  Copyright © 2015年 admin. All rights reserved.
 //

 #include <iostream>
 #include <map>
 using namespace std;
 map<string,int> color;
 char s[];
 int main() {
     int n;

     while (scanf("%d",&n))
     {
         if (n==) break;
         for (int i=;i<=n;i++)
         {
             scanf("%s",s);
             color[s]+=;
         }
         map<string,int>::iterator j;
         int ans=;
         string anss;
         for (j=color.begin();j!=color.end();++j)
         {
             if (j->second > ans)
             {
               ans=j->second;
               anss=j->first;
             }
             color[j->first]=;
         }
         cout<<anss<<endl;

     }
     return ;
 }