View Code of Problem 134

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

struct node{
	int i;
	int ans;
};

bool cmp(node a,node b){
	return a.ans<b.ans;
}
 
int main() {
 
	int n;
	while(cin>>n){
		node a[n];
		for(int i=0;i<n;i++){
			cin>>a[i].ans;
			a[i].i=i+1;
		}
		sort(a,a+n,cmp);
		int q;
		cin>>q;
		while(q--){
			int l,r;
			cin>>l>>r;
			for(int i=0;i<n;i++){
				if(a[i].i>=l&&a[i].i<=r){
					cout<<a[i].ans<<endl;
					break;
				}
			}
		}
	} 
 
	return 0;
}