#include <fstream>
#include <queue>
#include <set>

using namespace std;

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

queue<int> q;
multiset<int> my_set;

unsigned N, K;
int val;
long long sum;

int main()
{
    in >> N >> K;
    for(unsigned i = 1; i <= K; ++i)
    {
        in >> val;
        my_set.insert(val);
        q.push(val);
    }
    for(unsigned i = 1; i <= N - K; ++i)
    {
        sum += *my_set.begin();
        my_set.erase(my_set.find(q.front()));
        in >> val;
        my_set.insert(val);
        q.pop();
        q.push(val);
    }
    out << sum + *my_set.begin();
    return 0;
}