离了个大谱了!

题目给的测试样例我运行的结果是没问题的, 但是提交的结果是WA和TLE交织,没有一个对的,真的服了!

#include <iostream>
using namespace std;
int n, q, cz, x, y, index;
struct shuzi{
	int s;
	bool i = 0;
}a[8002], b[8002];

int so(int k){
    for(int i=1;i<=n;i++){
        b[i].s = a[i].s;
    }
    b[k].i = 1;
    for (int i = 1; i <= n; i++){
		for (int j = i; j >= 2; j--){
			if (b[j].s < b[j-1].s) {
				shuzi t = b[j-1];
				b[j-1] = b[j];
				b[j] = t;
			}
		}
    }
    //cout << a[1].s << "===" << a[2].s << "===" << a[3].s << endl;
    for(int i=1;i<=n;i++){
		if(b[i].i == 1){
			return i;
		}
	}
}
 
int main(){
	cin >> n >> q;
    for(int i=1;i<=n;i++){
		cin >> a[i].s;
	}
	for(int i=0;i<q;i++){
		cin >> cz;
		if(cz == 1){
			cin >> x >> y;
			a[x].s = y;
		}else{
			cin >> x;
			index = so(x);
			cout << index << endl;
		}
	}
    	
    return 0;
}

求大佬指点迷津!!!