标签:
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 90295 Accepted Submission(s): 34294
1 #include<cstdio> 2 #include<cstring> 3 #include<string> 4 #include<map> 5 #include<iostream> 6 using namespace std; 7 #define N 1010 8 map <string,int> mp; 9 struct MAX { 10 int a; 11 string color; 12 }; 13 int main() 14 { 15 int n; 16 while(~scanf("%d",&n),n) 17 { 18 mp.clear(); 19 for(int i =0 ;i < n ;i++) 20 { 21 char ss[20]; 22 scanf("%s",ss); 23 string s = ss; 24 if(mp.find(ss)==mp.end()) mp[s] = 1; 25 else mp[s]++; 26 } 27 MAX mx; 28 int sum = 0 ; 29 map <string , int >:: iterator it; 30 for( it = mp.begin(); it!=mp.end(); it++) 31 { 32 if(sum<(*it).second) 33 { 34 sum = (*it).second; 35 mx.a = sum; 36 mx.color = (*it).first; 37 } 38 } 39 printf("%s\n",mx.color.c_str()); 40 } 41 return 0; 42 }
标签:
原文地址:http://www.cnblogs.com/shanyr/p/4724526.html