View Code of Problem 134

#include<iostream>
#include<algorithm>
using namespace std;
struct sz {
	int id;
	int num;

}a[100001];
//sz a[10001];
bool cmp(sz a, sz b)
{
	return a.num < b.num;
}
int main()
{
	int n;
	while (cin >> n)
	{
		for (int i = 0;i < n;i++)
		{
			cin >> a[i].num;
			a[i].id = i + 1;
		}
		sort(a, a + n, cmp);
		int m;
		cin >> m;
		for (int i = 0;i < m;i++)
		{
			int l, r;
			cin >> l >> r;
			for (int i = 0;i < n;i++)
			{
				if (a[i].id <= r && a[i].id >= l)
				{
					cout << a[i].num << endl;
					break;
				}
			}
		}
	}
	
}