改对必关，只不过我这个蒟蒻还是求个悬关

#include<bits/stdc++.h>
using namespace std;
int a[100100];
int n,q;
int b[100100];
void Sort()
{
    for (int i = 1; i <= n; i++)
    {
	    for (int j = i; j >= 2; j--)
	    {
		    if (a[j] < a[j-1]) {
			    int t = a[j-1];
			    a[j-1] = a[j];
			    a[j] = t;
		    }
        }
    }
}
int main()
{
    cin>>n>>q;
    for(int i = 1;i<=n;i++)
    {
        cin>>a[i];
    }
    while(q--)
    {
        int op;
        cin>>op;
        if(op == 1)
        {
            int x,y;
            cin>>x>>y;
            a[x] = y;
        }
        else
        {
            int k;
            cin>>k;
            int s = a[k];
            memset(b,0,sizeof(b));
            for(int i = 1;i<=n;i++)
            {
                b[i] = a[i];
            }
            Sort();
            for(int i = 1;i<=n;i++)
            {
                if(a[k] == s)
                {
                    cout<<i<<endl;
                }
            }
            for(int i = 1;i<=n;i++)
            {
                a[i] = b[i];
            }
        }
    }
    return 0;
}