Let the Balloon Rise <map>的应用

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.

InputInput 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. 
OutputFor 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
常规解法：

#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	char  str[10000][20],k[100];
	int n;
	while (cin >> n && n != 0)
	{
		int  a[10000] = { 0 };
		int mark = 0;
		int max = 0,ko = 0;
		for (int i = 0; i < n; i++)
		{
			int flag = 0;
			cin >> k;
			for (int j = 0; j < mark; j++)
			{
				if (strcmp(str[j], k)==0)
				{
					a[j]++;  flag = 1;
					if (a[j] > max)
					{
						max = a[j];
						ko = j;
					}
					break;
				}
			}
			if (!flag)
				strcpy(str[mark++], k);
		}
		cout << str[ko] << endl;
	}
	return 0;
}

　　map的解法（水题）：

 #include <iostream>
 #include <map>
 #include <string>
 using namespace std;
 int main()
 {
     int ballnum;
     while (cin >> ballnum && ballnum != )
     {
         string temp,ko;
         int bigger = ;
         map<string, int> balloon;

         for (int i = ; i<ballnum; i++)
         {
             cin >> temp;
             balloon[temp]++;
             if (balloon[temp] > bigger)
             {
                 bigger = balloon[temp];
                 ko = temp;
             }
         }
         cout << ko << endl;

     }
     return ;
 }