NYOJ-king VS king

最新推荐文章于 2018-03-28 16:59:54 发布

凌摩绛霄

最新推荐文章于 2018-03-28 16:59:54 发布

阅读量587

点赞数

本文链接：https://blog.csdn.net/qq_18062811/article/details/38965149

版权

http://acm.nyist.net/JudgeOnline/problem.php?pid=153

参考代码:

#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int T,i,n,a[101],b[101],s1,s2;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d",&n);
		for(i=0;i<n;++i)
		scanf("%d",&a[i]);
		for(i=0;i<n;++i)
		scanf("%d",&b[i]);
		sort(a,a+n);
		sort(b,b+n);
		s1=s2=0;
		for(i=0;i<n;++i)
		{
			if(a[i]>b[i])
			s1+=2;
			else if(a[i]<b[i])
			s2+=2;
			else
			s1++,s2++;
		}
		if(s1==s2)
		printf("none\n");
		else if(s1>s2)
		printf("X\n");
		else 
		printf("Y\n");
	}
	return 0;
}