View Code of Problem 134

#include<iostream>
#include<algorithm>
using namespace std;
 
struct Num{
	int a,b;
}num[100001];
 
bool cmp(Num a,Num b){
	return a.a<b.a;
}
 
int main(void) {
	int n;
	while(scanf("%d",&n)!=EOF){
		for(int i=0;i<n;i++){
			scanf("%d",&num[i].a);
			num[i].b=i+1;
		}
		sort(num,num+n,cmp);
		int q;
		scanf("%d",&q);
		while(q--){
			int l,r;
			scanf("%d %d",&l,&r);
			for(int i=0;i<n;i++){
				if(num[i].b>=l&&num[i].b<=r){
					printf("%d\n",num[i].a);
					break;
				}
			}
		}
	}
}