#include <fstream>
#include <deque>
#include <vector>

using namespace std;

int main() {
    
    deque<int> dq;
    vector<int> v;
    ifstream fin("deque.in");
    int n, k;
    long long s = 0;
    fin >> n >> k;
    v.resize(n);
    for (int i = 0; i < n; ++i)
        fin >> v[i];
    fin.close();
    dq.push_back(0);
    
    for (int i = 1; i < n; ++i)
    {
        while (!dq.empty() && v[i] < dq.back())
            dq.pop_back();
        dq.push_back(i);
        if (i - dq.front() >= k)
            dq.pop_front();
        s += v[dq.front()];
    }
    
    ofstream fout("deque.out");
    fout << s;
    fout.close();
    
    return 0;
}