2095252_ac_0ms_68k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 54 行

# include <stdio.h>
# include <string.h>
# include <stdlib.h>
struct node
{
	int no;
	char name[81];
	char party[81];
}can[21];

int cmp(const void *a,const void *b)
{
	struct node *aa = (struct node *)a;
	struct node *bb = (struct node *)b;
	return bb->no-aa->no;
}

void input()
{
	int i, j, n, m;
	char tmp[81];

	scanf("%d",&n);
	getchar();
	for(i = 0; i < n; i++)
	{
		gets(can[i].name);
		can[i].no = 0;
		gets(can[i].party);
	}
	scanf("%d",&m);
	getchar();
	for(i = 0; i < m; i++)
	{
		gets(tmp);
		for(j = 0; j < n; j++)
			if(strcmp(tmp,can[j].name)==0)
			{
				can[j].no++;
				break;
			}
	}
	qsort(can,n,sizeof(can[0]),cmp);
	if(can[0].no==can[1].no)
		printf("tie\n");
	else
		printf("%s\n",can[0].party);
}

int main()
{
	input();
	return 1;
}