View Code of Problem 134

#include<iostream>
#include<math.h>
#include<stdio.h>
#include<algorithm>
using namespace std;
typedef struct{
	int data;
	int index;
}arr;
bool cmp(arr a,arr b){
	return a.data<b.data;
}
int main() {
	 int n;
	 while(scanf("%d",&n)!=EOF){
	 	arr a[n+1]={0};
	 	for(int i=1;i<=n;i++){
	 		scanf("%d",&a[i].data);
			  a[i].index=i;
		 }
		sort(a+1,a+n+1,cmp);
		int x;
		scanf("%d",&m);
		for(int i=0;i<x;i++){
			int t1,t2;
			scanf("%d %d",&t1,&t2);
		for(int i=1;i<=n;i++){
			if(a[i].index>=t1&&a[i].index<=t2){
				cout<<a[i].data<<endl;
				break;
			}
		}
		}
	 }
	 return 0;
}
/*
Main.cc: In function 'int main()':
Main.cc:23:15: error: 'm' was not declared in this scope
   scanf("%d",&m);
               ^
*/