Pagini recente » Cod sursa (job #2573835) | Cod sursa (job #147195) | Cod sursa (job #2883324) | Cod sursa (job #1977021) | Cod sursa (job #1315609)
#include<stdio.h>
using namespace std;
#define nmax 5000005
int n,k,v[nmax],d[nmax],f,b;
long long s;
void citire()
{
scanf("%d%d",&n,&k);
for(int i=1;i<=n;++i) scanf("%d",&v[i]);
}
void solve()
{
f=1;
for(int i=1;i<=n;++i)
{
while(v[f]>=v[i] && f<i ) f++;
if(i>=k)
s+=v[f];
if(i-f>k-2)
f++;
}
printf("%lld",s);
}
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
citire();
solve();
}