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(scanf("%d",&n)!=EOF) {
		struct node arr[n];
		for(int i=0; i<n; i++) {
			scanf("%d",&arr[i].data);
			arr[i].index=i+1;
		}
		sort(arr,arr+n,comp);	
		scanf("%d", &q);
		while(q--) {
			scanf("%d %d", &l, &r);
			for(int i=0; i<n; i++) {
				if(arr[i].index>=l&&arr[i].index<=r) {
					printf("%d\n",arr[i].data); 
					break;
				}
			}	
		}
	}

}