hdoj 1004
结构qsort 详见http://wenku.baidu.com/view/3a1c6900bed5b9f3f90f1c03.html
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
struct Balloon{
char ch[18];
int c;
}Balloons[1005];
int cmp( struct Balloon *a, struct Balloon *b)
{
//return (*(Balloon *)a).c > (*(Balloon *)b).c ? 1 : -1;;注意上下两个区别
//return (*(struct Balloon*)a).c - (*(structBalloon *)b).c ;//用C写要加struct
return a->c - b->c;
}
int main()
{
int n,i,j;
while(scanf("%d",&n)&&n!=0)
{
getchar();
scanf("%s",Balloons[0].ch);
Balloons[0].c=0;
for(i=1;i<n;i++)
{
scanf("%s",Balloons[i].ch);
Balloons[i].c=0;
for(j=0;j<i;j++)
{
if(strcmp(Balloons[j].ch,Balloons[i].ch)==0) Balloons[i].c++;
}
}
qsort(Balloons,n,sizeof(Balloons[0]),cmp);
printf("%s\n",Balloons[n-1].ch);
}
return 0;
}