代码：

#include<bits/stdc++.h>
using namespace std;
int a[11000],n,q;
void px(int x1[],int x2[]){
	for(int i = 1;i<=n;i++){
	    for(int j = i;j>=2;j--){
	        if(x1[j]<x1[j-1]){
	            int tmp1=x1[j-1],tmp2=x2[j-1];
	            x1[j-1]=x1[j];
	            x1[j]=tmp1;
	            x2[j-1]=x2[j];
	            x2[j]=tmp2;
	        }
	    }
	}
}
inline int read(){
	int s = 0,f = 1;
	char ch = getchar();
	while(ch<'0'||ch>'9'){
		if(ch=='-')f = -1;
		ch = getchar();
	}
	while(ch>='0'&&ch<='9'){
		s = (s<<1)+(s<<3)+(ch^48);
		ch = getchar();
	}
	return s*f;
}
inline void write(int x){
	if(x<0){
		putchar('-');
		x = -x;
	}
	if(x>9)write(x/10);
	putchar(x%10+'0');
} 
int main(){
	n = read();
	q = read();
	for(int i = 1;i<=n;i++)cin>>a[i];
    for(int i = 1;i<=q;i++){
        int x,v,m;
        m = read(); 
        if(m==1){
        	x = read();
        	v = read();
            a[x]=v;
        }
        else{
			x = read();
            int x1[11000],x2[11000];
            for(int i=1;i<=n;i++){
                x1[i]=a[i];
                x2[i]=i;
            }
            px(x1,x2);
            for(int j = 1;j<=n;j++){
                if(x2[j]==x){
                	write(j);
                	putchar('\n');
				}
            }
        }
    }
    return 0;
}

52分TLE