#include <fstream>

using namespace std;
long long v[5000005];
int st[5000005];

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

int main()
{
    int n,k,left,right,i;
    long long sum=0;
    in>>n>>k;
    for(i=1;i<=n;i++)
    {
        in>>v[i];
        if(i==1)
        {
            left=right=1;
            st[1]=1;
        }
        else
        {
            while(v[st[right]]>v[i] && right>=left)
                right--;
            right++;
            st[right]=i;
            if(st[left]<=i-k) left++;
        }

        if(i>=k) sum+=v[st[left]];
    }
    out<<sum<<'\n';
    return 0;
}