第四届传智杯 C(还就内阁神志不清)

题目
题意: 给定数组A和数组B，判断能否在n^2次操作以内使得数组A变成数组B。
思路: 两个数组都sort，判断是否完全一致，若不满足，说明寄了。否则，操作数可以保证在n^2以内的，因为每次交换消除一个逆序对，逆序对也就 n*n/2. 因为n<=1e3,直接 n ^ 2暴力找就行，而且输出还n^2级别呢.
时间复杂度: O(n^2)
代码:

// Problem: T229472 C. 排排队
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/T229472?contestId=63744
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<complex>
#include<cstring>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<list>
#include<set>
#include<queue>
#include<stack>
#define OldTomato ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr)
#define fir(i,a,b) for(int i=a;i<=b;++i) 
#define mem(a,x) memset(a,x,sizeof(a))
#define p_ priority_queue
// round() 四舍五入 ceil() 向上取整 floor() 向下取整
// lower_bound(a.begin(),a.end(),tmp,greater<ll>()) 第一个小于等于的
// #define int long long //QAQ
using namespace std;
typedef complex<double> CP;
typedef pair<int,int> PII;
typedef long long ll;
// typedef __int128 it;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const int N = 1003;
const int M = 1e6+10;
const int mod = 1e9+7;
const double eps = 1e-6;
inline int lowbit(int x){ return x&(-x);}
template<typename T>void write(T x)
{
    if(x<0)
    {
        putchar('-');
        x=-x;
    }
    if(x>9)
    {
        write(x/10);
    }
    putchar(x%10+'0');
}
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
int n,m,k,T;
int a[N];
int b[N];
int va[N];
int vb[N];
void solve()
{
   read(n);
   for(int i=1;i<=n;++i) {read(a[i]);va[i] = a[i];}
   for(int i=1;i<=n;++i) {read(b[i]);vb[i] = b[i];}
   bool flag = true;
   sort(va+1,va+n+1); sort(vb+1,vb+n+1);
   for(int i=1;i<=n;++i)
   {
   	  if(va[i] != vb[i]) flag = false;
   }
   if(flag)
   {
   	    puts("YES");
		for(int i = 1;i <= n;i++){
			if(a[i] == b[i])
			{
			   continue;
			}
			int wh = b[i]; //到达
			for(int j=1;j<=n;++j)
			{
				if(i == j) continue;
				if(a[j] == wh)
				{
					for(int k=j;k>i;--k)
					{
						swap(a[k],a[k-1]);
						printf("%d %d\n",k,k-1);
					}
				}
			}
		}
		printf("0 0\n");
   }
   else
   {
   	  puts("NO");
   }
}
signed main(void)
{  
   T = 1;
   // OldTomato; cin>>T;
   read(T);
   while(T--)
   {
   	 solve();
   }
   return 0;
}