#include<iostream>
#include<fstream>
#include<deque>
#include<climits>
using namespace std;
struct ij
{
    long long val;
    long long pos;
};
deque <int> st;
int n, v[5000005], mi = INT_MAX, s, I, k, i, x;
int main()
{
    freopen("deque.in", "r", stdin);
    freopen("deque.out", "w", stdout);
    scanf("%d%d", &n, &k);
    for( i = 1; i <= n; i++)
    {
        scanf("%d", &v[i]);
        while(!st.empty() && v[st.back()] >= v[i])
            st.pop_back();
        st.push_back( i);
        if(!st.empty() && st.front()<= i - k)
            st.pop_front();


        if(i >= k)
            s += v[st.front()];
    }
    printf("%d", s);
}