View Code of Problem 134

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

}sz;
bool cmp(sz a, sz b)
{
	return a.num < b.num;
}
int main()
{
	int n;
	cin >> n;
	vector<sz>a;
	for (int i = 0;i < n;i++)
	{
		sz b;
		cin >> b.num;
		b.id = i + 1;
		a.push_back(b);
	}
	sort(a.begin(),a.end(), cmp);
	int m;
	cin >> m;
	for (int i = 0;i < n;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;
			}
		}
	}
}