View Code of Problem 134

#include<iostream>
#include<algorithm>
using namespace std;
 
struct num{
    int data,id;
}nu[100001];
bool cmp(num a,num b)
{
    return a.data<b.data;
}
 
int main(void){
	int n;
	while(~scanf("%d",&n)){
		for(int i=1;i<=n;i++){
			scanf("%d",&nu[i].data);
			nu[i].id=i;
		}
		int t,a,b;
		cin>>t;
		sort(nu+1,nu+n+1,cmp);
		while(t--){
			scanf("%d %d",&a,&b);
			for(int i=1;i<=n;i++)
	            if(nu[i].id>=a&&nu[i].id<=b)
		        {
		            printf("%d\n",nu[i].data);break;
		        }
		}
		 
	}
}