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;
}
sz a[100001];
int main()
{
	int n;
	while (scanf("%d", &n)!=EOF)
	{
		for (int i = 0;i < n;i++)
		{
			scanf("%d", &a[i].num);
			a[i].id = i + 1;
		}
		sort(a, a + n, cmp);
		int m;
		int l, r;
		scanf("%d", &m);
		while (m--)
		{
			scanf("%d %d", &l, &r);
			for (int j = 0;j < n;j++)
			{
				if (a[j].id >= l&&a[j].id <= r )
				{
					printf("%d\n", a[j].num);
					break;
				}
			}
		}
		
	}
	
}