View Code of Problem 134

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
	int index;
	int data;
};
bool comp(node a, node b) {
	return a.data<b.data;
}
int main() {
	int n,q,l,r;
	while(cin>>n) {
		struct node arr[n];
		for(int i=0; i<n; i++) {
			cin>>arr[i].data;
			arr[i].index=i+1;
		}
		sort(arr,arr+n,comp);	
		cin>>q;
		while(q--) {
			cin>>l>>r;
			for(int i=0; i<n; i++) {
				if(arr[i].index>=l&&arr[i].index<=r) {
					cout<<arr[i].data<<endl;
					break;
				}
			}	
		}
	}

}