题目传送门

Code:

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

int n, Q;
int temp;
int brr[200005];

void W (int x, int arr[]) {

	for (int i = 1; i <= n; i++)
		for (int j = i; j >= 2; j--)
			if (arr[j] < arr[j - 1]) {
				int t = arr[j - 1];
				arr[j - 1] = arr[j];
				arr[j] = t;
			}
	
	brr[temp] = arr[x];
	temp++;
	
	return;
}

int main() {

	int arr[8005];

	cin >> n >> Q;

	for (int i = 1; i <= n; i++) {
		cin >> arr[i];
	}
	for (int i = 0; i < Q; i++) {
		int a;

		cin >> a;

		if (a == 1) {
			int x, v;

			cin >> x >> v;

			arr[x] = v;
		} else {
			int x;

			W (x, arr);
		}
	}
	
	for (int i = 0;i < temp;i++){
		cout << brr[i] << endl;
	}
	
	return 0;
}