View Code of Problem 134

#include <iostream>
#include <algorithm>
using namespace std;
int getmin(int a[],int i,int j);

typedef struct num{
	int id;
	int value;
}num;

bool cmp(num a,num b){
	return a.value<b.value;
}

int main() {
	int n;
	while(scanf("%d",&n)!=EOF){
	num num[n+1];
	getchar();
	for(int i=1;i<=n;i++){
		num[i].id=i;
		scanf("%d",&num[i].value);
	}
	
	sort(num+1,num+n+1,cmp);

	int q;
	scanf("%d",&q);
	
	while(q--){
		int i,j,min;
		scanf("%d %d", &i, &j);
		for(int k=1;k<=n;k++){
			if(num[k].id>=i&&num[k].id<=j){
				printf("%d\n",num[k].value);
				break;
			}
		}
	}
	
	}
	return 0;
}