View Code of Problem 134

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

using namespace std;

int main()
{
	int n;
	int a[100002], b[100002];
	int q, l, r;
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> a[i];
	cin >> q;
	while(q--)
	{
		cin >> l >> r;
		for(int i = l-1; i <= r-1; i++)
			b[i] = a[i];
		sort(b+l-1, b+r);
		cout << b[l-1] << endl;
	}
	return 0;
}