Pagini recente » Cod sursa (job #445806) | Cod sursa (job #1476392) | Cod sursa (job #1158204) | Cod sursa (job #2636429)
//#include <iostream>
#include <fstream>
using namespace std;
long long n,a[5000005],i,mn=10000000,s,j,k;
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<1+k;i++)
{
if(a[i]<mn)
mn=a[i];
}
s=mn;
for(i=2;i<=n;i++)
{
if(a[i+k-1]<=mn)
{
mn=a[i+k-1];
s=s+mn;
}
else if(mn!=a[i-1])
{
s=s+mn;
}
else
{
mn=10000000;
for(j=i;j<i+k;j++)
{
if(a[j]<mn)
mn=a[j];
}
s=s+mn;
}
//cout<<mn<<' ';
}
cout<<s;
return 0;
}