#include <bits/stdc++.h>
using namespace std;
const int Nmax = 5e6 + 5;
int arr[Nmax];
deque <int> dq;
signed main() {
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
scanf("%d", &n);
scanf("%d", &k);
for (int i = 1; i <= n ;++i) {
scanf("%d", &arr[i]);
}
int sum = 0;
for (int i = 1; i <= k; ++i) {
while (!dq.empty() && arr[dq.front()] >= arr[i]) {
dq.pop_front();
}
dq.push_front(i);
}
sum += arr[dq.back()];
for (int i = k + 1; i <= n; ++i) {
while (!dq.empty() && arr[dq.front()] >= arr[i]) {
dq.pop_front();
}
dq.push_front(i);
if (dq.back() == i - k) {
dq.pop_back();
}
sum += arr[dq.back()];
}
printf("%d", sum);
}