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

不会C++的就用c语言来肝吧!!!👀️ #include <stdio.h>

int main ()

{

int n;

scanf("%d",&n);

while(n--){

int m;

scanf("%d",&m);

int a[m],b[m];

for(int i=0;i<m;i++){

scanf("%d",&a[i]);

}

for(int j=0;j<m;j++){

scanf("%d",&b[j]);

}

for(int k=0;k<m-1;k++){

for(int u=0;u<m-1-k;u++){

if(a[u]>a[u+1]){

int t=a[u];

a[u]=a[u+1];

a[u+1]=t;

}

if(b[u]>b[u+1]){

int g=b[u];

b[u]=b[u+1];

b[u+1]=g;

}

}

}

int sam=0,sum=0;

for(int l=0;l<m;l++){

if(a[l]>b[l]){

sam++;

}else if(a[l]==b[l]){

sam++;

sum++;

}else if(a[l]<b[l]){

sum++;

}

} if(sam>sum){

printf("X\n");

}else if(sam==sum){

printf("none\n");

}else if(sam<sum){

printf("Y\n");

}

}

return 0;

}

sort单核，简单好抄

#include <stdio.h>
#include <iostream>
#include <algorithm>

using namespace std;

int x[105];
int y[105];

int main(){
	int n;
	int i;
	scanf("%d",&n);
	while(n--){
		int X=0,Y=0;
		int c;
		scanf("%d",&c);
	for(i=0;i<c;i++){
		scanf("%d",&x[i]);
	}
    for(i=0;i<c;i++){
		scanf("%d",&y[i]);
	}		
	sort(x,x+c);
	sort(y,y+c);
	for(i=0;i<c;i++){
		if(x[i]>y[i]){
			X+=2;
		}
		else if(x[i]==y[i]){
			X+=1;
			Y+=1;
		}
		else if(x[i]<y[i]){
			Y+=2;
		}	
	}
	if(X==Y){
		printf("none\n");
	}	
	else if(X>Y){
		printf("X\n");
	}
	else if(X<Y){
		printf("Y\n");
	}
	}
	return 0;
}

sort 大法好
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
	int t,n;
	cin >> t;
	int a[105]={0};
	int b[105]={0};
	int cntx,cnty;
	while(t--)
	{
		cin >> n;
		cntx=0;
		cnty=0;
		for(int i=0;i<n;i++)
		{
			cin >> a[i];
		}
		for(int i=0;i<n;i++)
		{
			cin >> b[i];
		}
        sort(a,a+n);
        sort(b,b+n);
		for(int i=0;i<n;i++)
		{
			if(a[i]>b[i])
			{
				cntx=cntx+2;
			}
			else if(a[i]==b[i])
			{
				cntx++;
				cnty++;
			}
			else if(a[i]<b[i])
			{
				cnty=cnty+2;
			}
		}
		if(cntx>cnty)
		{
			cout << "X" << endl;
		}
		else if(cntx<cnty)
		{
			cout << "Y" << endl;
		}
		else if(cntx==cnty)
		{
			cout << "none" <<endl;
		}
	}
	return 0;
}