hdu1003 统计出现最多的颜色数（map容器☆☆☆☆☆）

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <map>
#include <string>

using namespace std;

int main(){

    int n;
    map<string,int> countMap;
    string word, tmp;
    char color[32];
    int maxCount;

    while(scanf("%d",&n)&&n){
        maxCount = 0;
        for(int i=0;i<n;i++){
            scanf("%s",color);
            tmp = color;
            if(countMap.find(tmp)==countMap.end()){
                countMap[tmp]=1;
            }
            else{
                countMap[tmp]++;
            }

            if(countMap[tmp]>maxCount){
                word = tmp;
                maxCount = countMap[tmp];
            }
        }

        printf("%s\n",word.c_str());
        countMap.clear();

    }

    return 0;
}