View Code of Problem 134

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

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