View Code of Problem 134

#include <map>
#include "stdlib.h"
#include<stdio.h>
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <string>
#include <iomanip>
#include "math.h"
using namespace std;
map<char, int> mp;
typedef struct s
{
	int data;
	int num;
}s;
int cmp(s a,s b)
{
	return a.data < b.data;
}
int main()
{
	int n, q, l, r; s x[100000];
	while (cin >> n)
	{
		for (int i = 0; i < n; i++)
		{
			scanf("%d", &x[i].data);
			x[i].num = i + 1;
		}
		sort(x,x+n,cmp);
		cin >> q;
		while (q--)
		{
			cin >> l >> r;
			for (int j = 0; j < n; j++)
			{
				if (x[j].num >= l && x[j].num <= r)
				{
					cout << x[j].data << endl;
					break;
				}
			}
		}
	}
	return 0;
}