Pagini recente » Monitorul de evaluare | Istoria paginii utilizator/ramonabotezatu25 | Istoria paginii utilizator/florii15 | Monitorul de evaluare | Cod sursa (job #1981864)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("deque.in");
ofstream g("deque.out");
const int N=5000001;
int v[N];
int n,k,m;
long long s=0,i,j,x=0;
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
while (x<=n-k)
{
m=v[x+1];
for(j=1+x;j<=k+x;j++)
{
if (v[j]<m)
{
m=v[j];
}
}
x++;
s=s+m;
}
g<<s;
return 0;
}