Pagini recente » Cod sursa (job #1625408) | Cod sursa (job #1692128) | Cod sursa (job #2088281) | Cod sursa (job #957201) | Cod sursa (job #2128972)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,k,i,v[500001],min[500001],l,max,j;
ifstream f("secventa.in");
ofstream g("secventa.out");
f>>n>>k;l=1;
for(i=1;i<=n;i++) f>>v[i];
for(i=1;i<=n-k;i++)
{
min[l]=v[i];l++;
for(j=i;j<=i+k;j++)
{
if(v[j]<min[l-1]) {min[l]=v[j];l++;}
}
}
max=min[1];
for(i=1;i<=l;i++) if(max>min[i]) max=min[i];
g<<max;
return 0;
}