玄学问题

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 3e5+10;
void read(int &x){
	x = 0;int p = 1;char ch;
	do{
		ch = getchar();
		if(ch=='-') p = -1;
	}while(!isdigit(ch));
	while(isdigit(ch)){
		x*=10;
		x+=ch-'0';
		ch = getchar();
	}
	x*=p;
}
void read(char &x){
	x = getchar();
	while(x==' '||x=='\n'||x=='\r') x = getchar();
}
void write(char x){
	putchar(x);
}
void write(int k){
	if(k<0) putchar('-');
	k = abs(k);
	stack<int> num;
	do{
		num.push(k%10);
		k/=10;
	}while(k);
	while(!num.empty()){
		putchar(num.top()+48);
		num.pop();
	}
}
struct node{
	int x,y,id;
}a[MAXN],b[MAXN];
bool cmp_x(node a,node b){
	return a.x<=b.x;
}
int T,n,m,to[2][MAXN];
signed main(){
	read(T);
	bool ttmp = T==10000;
	while(T--){
		read(n);
		for(int i = 1;i<=n;i++) read(a[i].x);
		for(int i = 1;i<=n;i++) read(a[i].y);
		sort(a+1,a+1+n,cmp_x);
		read(m);
		for(int i = 1;i<=m;i++) read(b[i].x);
		for(int i = 1;i<=m;i++) read(b[i].y);
		sort(b+1,b+1+m,cmp_x);
	}
	return 0;
}

1
4
3       7       9       3
3       6       7       10
83
2       10      2       10      3       8       9       7       5       4       7       7       6       8       9       7       5       10      5       9       3       5       9       10      2       9       5       2       10      1       4       7       6       8       8       10      9       9       2       7       4       7       7       6       9       7       2       2       7       3       5       2       10      9       1       1       5       2       1       6       3       9       5       1       7       10      1       10      3       10      1       3       4       4       3       1       7       4       6       1       4       4       2
5       4       4       7       2       7       4       10      6       1       6       10      9       10      2       7       5       6       1       8       8       9       8       10      10      4       5       2       6       5       5       5       9       9       2       6       6       9       5       6       1       5       1       3       5       3       6       8       10      5       9       2       4       7       4       1       8       5       8       7       3       6       5       10      9       4       1       5       8       9       6       7       7       5       9       7       5       10      1       3       9       10      1