View Code of Problem 134

#include <iostream>
#include <string>
#include <cmath>		
#include <algorithm>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <queue>
using namespace std;

int main()
{
	int i, j, flag, k;
	int n,t, m;
	string s;
	int a, b;
	while (cin >> n)
	{
		vector<int>v;
		for (i = 0; i < n; ++i)
		{
			scanf("%d", &t);
			v.push_back(t);
		}
		scanf("%d", &t);
		while (t--)
		{
			scanf("%d%d", &a,&b);
			int index = min_element(v.begin()+a-1,v.begin()+b)-v.begin();
			printf("%d\n", v[index]); 
		}
	}
	
	return 0;
}