#include <iostream>
#include <fstream>
#include <climits>

using namespace std;

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


int a[5000001], st[5000001], dr[500001];

int main()
{
    int n, k;
    fin >> n >> k;
    for(int i = 1; i <= n; i++)
    {
        fin >> a[i];
    }
    st[0] = INT_MAX;
    for(int i = 1; i <= n; i++)
    {
        if(i % k == 1)
            st[i] = a[i];
        else
            st[i] = min(st[i - 1], a[i]);
    }
    dr[n + 1] = INT_MAX;
    dr[n] = a[n];
    for(int i = n - 1; i >= 1; i--)
        if(i % k == 0)
            dr[i] = a[i];
        else
            dr[i] = min(dr[i + 1], a[i]);

    long long rez = 0;
    int a = 1, b = k;
    while(b <= n)
    {
        rez += min(dr[a], st[b]);
        ++a;
        ++b;
    }
    cout << rez;
    fin.close();
    fout.close();
    return 0;
}