#include <fstream>
#include <deque>

using namespace std;

deque <pair <long long, long long> > v;
long long a[5000010], n, k, s;


int main() {

    ifstream cin ("deque.in");
    ofstream cout ("deque.out");

    cin >> n >> k;
    for (int i=1; i<=n; i++)
        cin >> a[i];
    for (int i=1; i<=k; i++)
    {
        while (v.size() > 0 && v.back().first > a[i] )
            v.pop_back();
        v.push_back(make_pair( a[i], i) );
    }
    s += v.front().first;

    for (int i=k+1; i<=n; i++)
    {
        if (v.front().second == i-k)
            v.pop_front();
        while (v.size() > 0 && v.back().first > a[i] )
            v.pop_back();
        v.push_back(make_pair( a[i], i) );
        s += v.front().first;
    }

    cout << s;

    return 0;
}