#include <iostream>
#include <fstream>
#include <deque>
#define int long long

std::ifstream in("deque.in");
std::ofstream out("deque.out");
int n, k;

int r = 0;
std::deque<std::pair<int, int>> dq;

signed main()
{
    in >> n >> k;
    for ( int i = 1, x; i <= n; ++i )
    {
        in >> x;
        while ( !dq.empty() and dq.front().second < i - k + 1 )
          dq.pop_front();
        while ( !dq.empty() and dq.back().first >= x )
          dq.pop_back();
        dq.emplace_back(x, i);

        if ( i >= k )
            r+= dq.front().first;
    }

    out << r;
    return 0;
}