HDU1004

Let the Balloon Rise

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 120896    Accepted Submission(s): 47475

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
  
  
  
  


  
  
  
  

   
   //找出输入的字符序列中重复次数最多的（题目保证每一个测试案例只有一个是最多的）
//利用sort 对字符序列排序，之用整型数组进行同步计数
  
  
  
  

   
   
#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

int main()
{
    string s[1001];
    int n;
    while(cin>>n&&n)
    {
        for(int i=0;i<n; ++i)
            cin>>s[i];
        sort(s,s+n);//字符串排序，将相同的字符串放在一起
        int sum[1001];
        for(int i=0;i<n;i++)
            sum[i]=1;
        int max=0;
        sum[max]=1;
        int i;
        for(i=1;i<n;i++)
        {
            if(s[i]==s[i-1])//利用整型数组进行同步计数
                sum[i]+=sum[i-1];
            if(sum[i]>sum[max])
                max=i;
        }
        cout<<s[max]<<endl;
    }
    return 0;
}