#include <iostream>

using namespace std;

#define maxN 5000005

int A[maxN], D[maxN];

int main()
{
	freopen ("deque.in", "r", stdin);
	freopen ("deque.out", "w", stdout);
	
	int N, K, st = 1, dr = 0;
	long long S = 0;
	
	scanf ("%d %d", &N, &K);
	
	for (int i = 1; i <= N; ++ i)
	{
		scanf ("%d", &A[i]);
		
		if ( st <= dr && D[st] <= i - K ) ++ st;
		
		while ( st <= dr && A[D[dr]] > A[i] ) -- dr;
		
		D[++ dr] = i;
		
		if (i >= K) S += A[D[st]];
	}
	
	printf ("%lld", S);
	
	return 0;
}