8分求调

#include<bits/stdc++.h>
using namespace std;
const int MAXN = 8005;
int n, q, x, y, z;
struct node
{
	int m, id;
}a[MAXN], b[MAXN];
int main()
{
	cin >> n >> q;
	for(int i = 1; i <= n; i++)
	{
		cin >> a[i].m;
		b[i].m = a[i].m;
		b[i].id = i;
		a[i].id = i;
	}
	while(q--)
	{
		cin >> x;
		if(x == 1)
		{
			cin >> y >> z;
			for(int i = 1; i <= n; i++) a[i].m = b[i].m;
			for(int i = 1; i <= n; i++)
			{
				if(a[i].m == b[y].m) a[i].m = z;
				a[i].id = i;
			}
		}
		else
		{
			cin >> y;
			for(int i = 1; i <= n; i++)
			{
				for(int j = i; j >= 2; j--)
				{
					if(a[j].m < a[j - 1].m)
					{
						int t = a[j - 1].m, tt = a[j - 1].id;
						a[j - 1].m = a[j].m;
						a[j - 1].id = a[j].id;
						a[j].m = t;
						a[j].id = tt;
					}
				}
			}
			for(int i = 1; i <= n; i++)
			{
				if(a[i].id == y)
				{
					cout << i << endl;
					break;
				}
			}
		}
	}
	return 0;
}