View Code of Problem 134

#include<stdio.h>
int cmp(const void *a,const void *b){
	return *(int *)a - *(int *)b;
}
int main(){
	int n;
	while(scanf("%d",&n)!=EOF){
		int a[n];
		int i;
		for(i = 0;i < n; i++){
			scanf("%d",&a[i]);
		} 
		int q;
		scanf("%d",&q);
		while(q--){
			int l,r;
			scanf("%d %d",&l,&r);
			int len = r-l+1;
			int newa[len],num = 0;
			for(i = l;i <= r; i++){
				newa[num++] = a[i];
			}
			qsort(newa,num,sizeof(int),cmp);
			printf("%d\n",newa[0]);
		}
	}
}