杭电oj1004最流行的气球颜色

#include <iostream>
#include <string>
#include <vector>
 #include <algorithm>
  using namespace std;
  int main()
   { int n;
   while(cin>>n)
   { if(n==0)
   break;
    else
 {
 string *str=new string[n]();
  int* idex=new int[n]();
   int count=0;
   for (int i=0;i!=n;++i)
   { cin>>str[i];
   bool flag=1;
    for (int ii=0;ii!=i;++ii)
     { if (str[i]==str[ii])
   { ++idex[ii]; flag=0; } }
    if(flag==1)
    ++idex[count++];
    }
    int max=idex[0],maxnum=0;
     for (int i=0;i!=count;++i)
     { if (idex[i]>max)
      { max=idex[i];
    maxnum=i;
    }
     }
      cout<<str[maxnum]<<endl;
      }
       }
     return 0;
      }