#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
const int maxn = 5000005;
int v[maxn];
deque <int> dq;

int main()
{
    int n, k;
    in >> n >> k;
    long long sum = 0;
    for(int i = 1; i <= n; i++)
        in >> v[i];
    for(int i = 1; i < k; i++)
    {
        while(!dq.empty() && v[dq.back()] >= v[i])
            dq.pop_back();
        dq.push_back(i);
    }
    for(int i = k; i <= n; i++)
    {
        while(!dq.empty() && v[dq.back()] >= v[i])
            dq.pop_back();
        dq.push_back(i);
        if(dq.front() <= i - k)
            dq.pop_front();
        sum += v[dq.front()];
    }
    out << sum << '\n';
    return 0;
}