View Code of Problem 134

#include<iostream>
#include<stdio.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
struct num{
	int data;
	int id;
}a[100000];
bool cmp(num a,num b){
	return a.data<b.data;
}
int main(){
	int n;
	int q;
	while(~scanf("%d",&n)){
		for(int i=0;i<n;i++){
			cin>>a[i].data;
			a[i].id=i+1;
		}
		sort(a,a+n,cmp);
		//cin>>q;
		scanf("%d",&q);
		int l,r;
		for(int i=0;i<q;i++){
			//cin>>l>>r;
			scanf("%d %d",&l,&r);
			for(int j=0;j<n;j++){
				if(a[j].id>=l&&a[j].id<=r){
					cout<<a[j].data<<'\n';
					break;
				}
			}
			
			
			
		}

		}

	}