样例都过不去呜呜呜

#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
#define maxn 8010

struct node {
	int key, num;
} a[maxn], b[maxn];

int n, q;

bool cmp(node a, node b) {
	return a.key > b.key;
}

void copy(node *a, node *b, int len) {
	for(int i = 1; i <= len; i ++)
		b[i].key = a[i].key, b[i].num = a[i].num;
}

int main() {
	cin >> n >> q;
	for(int i = 1; i <= n; i ++)
		cin >> a[i].key, a[i].num = i;
	sort(a + 1, a + n + 1, cmp);
	while(q --) {
		int opt, x, y;
		cin >> opt;
		if(opt == 1) {
			cin >> x >> y;
			a[x].key = y;
		} else {
			cin >> x;
			copy(a, b, n);
			sort(b + 1, b + n + 1, cmp);
			for(int i = 1; i <= n; i ++)
				if(b[i].num == x) {
					cout << i << endl;
					break;
				}
		}
	}
	return 0;
}