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++)
		{
			cin >> t;
			v.push_back(t);
		}
		cin >> t;
		while (t--)
		{
			cin >> a >> b;
			int index = min_element(v.begin()+a-1,v.begin()+b)-v.begin();
			cout << v[index] << endl;
		}
	}
	
	return 0;
}