Pagini recente » Cod sursa (job #1492951) | Cod sursa (job #1568622) | Cod sursa (job #1816784) | Cod sursa (job #2043178) | Cod sursa (job #1371359)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,min,m,i,j,b[10][2],a[10],k;
int main ()
{
fin>>n>>m;
for (i=1;i<=n;i++)
fin>>a[i];
for (int k=1; k<=m;k++)
for(j=1;j<=2;j++)
fin>>b[k][j];
for(k=1;k<=m;k++)
{
int min=b[k][2];
for(i=1;i<=n;i++)
{
if (a[i]<min && a[i] >= b[k][1] )
min=a[i];
}
fout<<min;
fout<<endl;
}
return 0;
}