C :

#include<stdio.h>
int main()
{
    int n,Q;
    scanf("%d%d",&n,&Q);
    int a[n];
    int b[Q];
    int i,j,k,l,p;
    for(i=0;i<n;i++)
    scanf("%d",&a[i]);
    while(Q--)
    {
        scanf("%d%d",&k,&l);
        for(i=k;i<l;i++)
            for(j=k+1;j<=l;j++)
        {
            if(a[i]>a[j])
            {
                p=a[i];
                a[i]=a[j];
                a[j]=p;
            }
        }
        printf("%d\n",a[k]);
    }
    return 0;
}

C++ :

#include <iostream>
using namespace std;

typedef struct {
	int start;
	int end;
	int result;
}stQuery;


int findMin(int start, int end, int datas[1984])
{
	int i = start, min = datas[start];
	while (i <= end) {
		if (min > datas[i]) {
			min = datas[i];
		}
		i++;
	}
	return min;
}

int main()
{
	int i = 0, dataNum, queryNum;
	int datas[1984];
	stQuery querys[1988] = { 0 };
	cin >> dataNum >> queryNum;
	while (i < dataNum) {
		cin >> datas[i];
		i++;
	}
	i = 0;
	while (i < queryNum) {
		cin >> querys[i].start >> querys[i].end;
		querys[i].result = findMin(querys[i].start, querys[i].end, datas);
		i++;
	}
	i = 0;
	while (i < queryNum) {
		cout << querys[i].result << endl;
		i++;
	}
	return 0;
}

Pascal :

var
  a:array[0..2222]of longint; 
  min,i,j,n,q,l,r:longint;

function remin(a,b:longint):longint;
begin
  if a<b then exit(a)
    else exit(b);
end;

begin
  readln(n,q);
  for i:=0 to n-1 do
    read(a[i]);
  for i:=1 to q do
  begin
    readln(l,r);
    min:=maxlongint;
    for j:=l to r do
      min:=remin(min,a[j]);
    writeln(min);
  end;
end.