这是WA了的代码，还T了“几个”点

#include<bits/stdc++.h>
using namespace std;
int x,u,n,q,ans;
int c;
struct node{
	int id,num;
}a[8005],b[8005];
int main()
{
	cin>>n>>q;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].num;
		a[i].id = i;
		b[i].num = a[i].num;
		b[i].id = i;
	}
	while(q--)
	{
		cin>>c;
		for(int i=1;i<=n;i++)
			a[i].num = b[i].num,a[i].id = i;
		if(c == 1)
		{
			cin>>x>>u;
			a[x].num = u;
			b[x].num = u;
		}
		else if(c == 2)
		{
			cin>>x;
			int sum = a[x].num;
			int d = a[x].id;
			for(int i=1;i<=n;i++)
				for(int j=i;j>=2;j--)
					if(a[j].num<a[j-1].num)
					{
						if(a[j].num == sum && a[j].id == d)
						{
							ans = j - 1;
						}
						int t = a[j-1].num;
						a[j-1].num = a[j].num;
						a[j].num = t;
					}
			cout<<ans<<endl;
		}
	}
	return 0;
}

帮帮本蒟蒻吧！！！qwq