Pagini recente » Cod sursa (job #2466977) | Cod sursa (job #598753) | Cod sursa (job #312834) | Cod sursa (job #1557131) | Cod sursa (job #285828)
Cod sursa(job #285828)
#include <fstream>
using namespace std;
long a[50000];
long n, k;
int main()
{
long min = 9999900;
long min2 = 99999;
long max;
long i, j;
ifstream fin("secventa.in");
fin >> n >> k;
for ( i = 0; i < n; i++)
fin >> a[i];
fin.close();
for ( i = 0; i < k ; i++)
if ( a[i] <= min2)
if (a[i] <= min)
min = a[i];
else
min2 = a[i];
i = 0; j = k - 1;
max = min;
while ( j < n)
{
if ( a[j] <= min2 )
if ( a[j] <= min)
min = a[j];
else
min2 = a[j];
if ( min > max)
max = min;
j++; i++;
if ( a[i] == min) min = min2;
}
ofstream fout("secventa.out");
fout << max << '\n';
fout.close();
return 0;
}