大佬们看看本蒟蒻的考场code能拿几分QAQ

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll n,q;

struct node
{
	ll pre,val;
}a[114514];

inline ll aya(node b[],ll x)
{
	node a[114514];
	for(register int i=1;i<=n;i++)
	{
		a[i].val=b[i].val;
		a[i].pre=i;
	}
	for(register int i=1;i<=n;i++)
		for(register int j=i;j>=2;j--)
			if(a[j].val<a[j-1].val)
			{
				swap(a[j],a[j-1]);
			}
	for(register int i=1;i<=n;i++)
	{
		if(a[i].pre==x)
		{
			return i;
		}
	}
}


int main()
{
	freopen("sort.in","r",stdin);
	freopen("sort.out","w",stdout);
	
	scanf("%lld%lld",&n,&q);
	for(register int i=1;i<=n;i++)
	{
		scanf("%lld",&a[i].val);
	}
	
	while(q--)
	{
		ll tmp;
		scanf("%lld",&tmp);
		if(tmp==1)
		{
			ll x,v;
			scanf("%lld%lld",&x,&v);
			a[x].val=v;
		} 
		else if(tmp==2)
		{
			ll x;
			scanf("%lld",&x);
			printf("%lld",aya(a,x));
			cout<<endl;
		}
	}
	
	return 0;
}
//我永远喜欢射命丸文\aya