View Code of Problem 134

#include<iostream>
#include<math.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
typedef struct{
	int data;
	int index;
}arr;
bool cmp(arr a,arr b){
	return a.data<b.data;
}
int main() {
	 int n;
	 while(scanf("%d",&n)!=EOF){
	 	arr a[n];
	 	for(int i=0;i< n;i++){
	 		cin>>a[i].data;
			  a[i].index=i;
		 }
		sort(a,a+n,cmp);
		int x;
		cin>>x;
		while(x--){
			int l,r;
			cin>>l>>r;
		for(int i=0;i<n;i++){
			if(a[i].index>=l&&a[i].index<=r){
				cout<<a[i].data<<endl;
				break;
			}
		}
		}
	 }
}