区间k大数查询

#include<iostream>

using namespace std;

void function(int* collect,int length,int index,int num){
	for (int i = length - 2; i >= index; i--){
		collect[i + 1] = collect[i];
	}
	collect[index] = num;
}

int main(void){
	int n;
	cin >> n;
	int* arr = new int[n + 1];
	for (int i = 1; i <= n; i++){
		cin >> arr[i];
	}
	int m;
	cin >> m;
	int l,k;
	int* collect;
	while (m--){
		cin >> l >> r >> k;
		collect = new int[k];
		for (int i = 0; i < k; i++){
			collect[i] = arr[l + i];
		}
		for (int i = k - 1; i > 0; i--){
			for (int j = 0; j <= i - 1; j++){
				if (collect[j] < collect[j + 1]){
					collect[j] += collect[j + 1];
					collect[j + 1] = collect[j] - collect[j + 1];
					collect[j] = collect[j] - collect[j + 1];
				}
			}
		}
		for (int i = l + k; i <= r; i++){
			if (arr[i] > collect[k - 1]){
				if (k >= 2){
					for (int index = k - 2; index >= 0; index--){
						if (collect[index] > arr[i]){
							function(collect,k,index + 1,arr[i]);
							break;
						}else{
							if (index == 0){
								function(collect,arr[i]);
							}
						}
					}
				}else{
					collect[k - 1] = arr[i];
				}	
			}else{
				//do nothing
			}
		}		
		cout << collect[k - 1] << endl;
		delete collect;
	}
	
	return 0;
}