pku2643.cpp

这是ACM 方面的资料 是PKU的 北京大学的出来的

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

typedef struct 
{
	char name[81];
	char party[81];
	int sum;
} Vote;

Vote p[21];

int cmp(const void *a, const void *b)
{
	Vote *aa = (Vote *)a;
	Vote *bb = (Vote *)b;
	return bb->sum - aa->sum;
}

int main()
{
	int n_v, n, i, j;

	char name[81];

//	freopen("in.dat", "r", stdin);
	scanf("%d\n", &n_v);

	for (i = 0; i < n_v; i++)
	{
		gets(p[i].name);
		gets(p[i].party);
		p[i].sum = 0;
	}

	scanf("%d\n", &n);
	
	for (i = 0; i < n; i++)
	{
		gets(name);

		for (j = 0; j < n_v; j++)
		{
			if (strcmp(name, p[j].name) == 0)
			{
				p[j].sum++;
				break;
			}
		}
	}

	qsort(p, n_v, sizeof(p[0]), cmp);
	
	for (i = 0; i < n_v; i++)
	{
//		printf("%s %s %d\n", p[i].name, p[i].party, p[i].sum);
	}

	if (p[0].sum == p[1].sum)
	{
		printf("tie\n");
	}
	else
	{
		printf("%s\n", p[0].party);
	}
	return 0;
}