View Code of Problem 134

#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>

using namespace std;
struct qulie{
	int num;
	int pripos;
};
bool cmp(qulie a,qulie b){
	return a.num<b.num;	
}
int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		qulie ss[n]={0};
		for(int i=0;i<n;i++){
			scanf("%d",&ss[i].num);
			ss[i].pripos=i+1;
		}
		sort(ss,ss+n,cmp);
		int q;
		scanf("%d",&q);
		for(int i=0;i<q;i++){
			int a,b;
			cin>>a>>b;
			for(int j=0;j<n;j++){
				if(ss[j].pripos>=a&&ss[j].pripos<=b){
					printf("%d\n",ss[j].num);
					break;
				}
			}
		}
	}
	return 0;
}