View Code of Problem 134

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
typedef struct node {
	long long num;
	int id;
}node;
bool cmp(node a, node b)
{
	return a.num < b.num;
}
int main()
{
	long long t;
	scanf("%lld", &t);
	vector<node>a;
	for (int i = 1;i <= t;i++)
	{
		node z;
		scanf("%lld", &z.num);
		z.id = i;
		a.push_back(z);
	}
	sort(a.begin(), a.end(), cmp);
	int q;
	cin >> q;
	while (q--)
	{
		int l, r;
		scanf("%d %d", &l,&r);
		for (int i = 0;i < t;i++)
		{
			if (a[i].id >= l && a[i].id <= r)
			{
				printf("%lld\n", a[i].num);
				break;
			}
		}
	}
	return 0;
}