#include <fstream>
#include <deque>
#include <iostream>

using namespace std;

int main() {
    ifstream in("deque.in");
    ofstream out("deque.out");

    int n, k;
    in>>n>>k;
    deque<pair<int, int>> d;

    for(int i=1;i<=k;i++)
    {
        int x;
        in>>x;

        while(!d.empty()&&d.back().first>=x)
            d.pop_back();

        d.push_back({x, i});
    }
    long long s=d.front().first;

    for(int i=k+1;i<=n;i++)
    {
        int x;
        in>>x;

        while(!d.empty()&&d.back().first>=x)
            d.pop_back();

        d.push_back({x, i});
        if(i-d.front().second+1>k)
            d.pop_front();

        s+=d.front().first;
    }

    out<<s;

    return 0;
}