View Code of Problem 134

#include<stdio.h>
#include<stdlib.h>
struct s{
	int order;
	int score;
};
int main(){
	int cmp(const void *a,const void *b);
	int n,k;
	scanf("%d",&n);
	s a[n];
	for(int i=0;i<n;i++){
		a[i].order=i+1;
		scanf("%d",&a[i].score);
	}
	qsort(a,n,sizeof(s),cmp);
	scanf("%d",&k);
	while(k-->0){
		int l,r;
		scanf("%d %d",&l,&r);
	for(int i=0;i<n;i++){
		if(a[i].order>=l&&a[i].order<=r){
			printf("%d\n",a[i].score);
			break;
		}
	}
}
}
int cmp(const void *a,const void *b){
	s *pa=(s *)a;
	s *pb=(s *)b;
	int numa=pa->score;
	int numb=pb->score;
	return numa-numb;
}