View Code of Problem 134

#include <iostream>
#include <algorithm>
using namespace std;

int main(){
    int n,q,a,b,size,min;
    while(scanf("%d",&n)!=EOF){
        int num[100001],buf[100001];
        for(int j=1;j<=n;j++){
            scanf("%d",&num[j]);
        }
        scanf("%d",&q);
        for(int j=0;j<q;j++){
            scanf("%d%d",&a,&b);
            size=0;
            for(int k=a;k<=b;k++){
                buf[size++] = num[k];
            }
            min=0;
//            sort(buf,buf+size);
            for (int l=0; l<size; l++) {
                if(buf[l]<buf[min])
                    min = l;
            }
            
            printf("%d\n",buf[min]);
        }
    }
    return 0;
}