View Code of Problem 134

#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>

using namespace std;

int main(){
	int n;
	while(cin>>n){
		int ss[n]={0};
		for(int i=0;i<n;i++){
			cin>>ss[i];
		}
		int q;
		cin>>q;
		for(int i=0;i<q;i++){
			int a,b;
			cin>>a>>b;
			int aa=a-1;
			int bb=b-1;
			int s[b-a+1]={0};
			int count=0;
			for(int j=aa;j<=bb;j++){
				s[count++]=ss[j];
			}
			sort(s,s+count);
			cout<<s[0]<<endl;
		}
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 134