NYOJ-king VS king

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;elses1++,s2++;}if(s1==s2)printf("none\n");else if(s1>s2)printf("X\n");else printf("Y\n");}return 0;}