用的stable_sort

#include<bits/stdc++.h>
using namespace std;
bool cmp(int a,int b){
	return a>b;
}
int m,n,l,r,a[100005],q;
bool p;
int main(){
	scanf("%d%d",&n,&m);
	for(int i=0;i<n;i++)
		scanf("%d",&a[i]);
	while(m--){
		cin>>p;
		scanf("%d%d",&l,&r);
		if(p)
			stable_sort(a+l,a+r,cmp);
		else
			stable_sort(a+l,a+r);
	}
	scanf("%d",&q);
	printf("%d\n",a[q-1]);
	return 0;
}