View Code of Problem 134

#include <stdio.h>
#include <algorithm>
using namespace std;

typedef struct list{
	int id;
	int data;
};
bool cmp( list a, list b ){
	return a.data<b.data;
}
int main(){
	int n,t;
	int l,r;
	while(~scanf("%d", &n )){
	    list arr[n];
		for( int i=0; i<n; i++ ){
			scanf("%d", &arr[i].data);
			arr[i].id = i+1;
			
		}
		sort(arr,arr+n,cmp);
		scanf("%d", &t );
		for( int i=0; i<t; i++ ){
			scanf("%d %d", &l, &r );
			for( int i=0; i<n; i++ ){
				if( arr[i].id>=l && arr[i].id<= r ){
					printf("%d\n", arr[i].data );
					break;
				}
			}
		}	
	}
	

	return 0;
	
}