hdu 2109 Fighting for HDU

思路：输入数据到两个数组当中，再排序，然后一一比较，统计各自得分

#include<stdio.h>
#include<stdlib.h>
int cmp(const void *a,const void *b)
{
	return *(int*)a-*(int*)b;
}
int main()
{
	int num1[200],num2[200];
	int sum1,sum2;
	int n;
	int i;
	while(scanf("%d",&n)!=EOF)
	{
		if(n==0)
		break;
		
		for(i=0;i<n;i++)
		{
			scanf("%d",&num1[i]);
		}
		for(i=0;i<n;i++)
		{
			scanf("%d",&num2[i]);
		}
		qsort(num1,n,sizeof(num1[0]),cmp);
		qsort(num2,n,sizeof(num2[0]),cmp);
		
		sum1=0;sum2=0;
		for(i=0;i<n;i++)
		{
			if(num1[i]>num2[i])
			sum1=sum1+2;
			else if(num1[i]==num2[i])
			{
				sum1=sum1+1;
				sum2=sum2+1;
			}
			else
			sum2=sum2+2;
		}
		printf("%d vs %d\n",sum1,sum2);
	}
	return 0;
}