#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <bitset>
#include <utility>

#define rep(i,a,b) for(int i=int(a); i<=int(b); ++i)
#define rev(i,b,a) for(int i=int(b); i>=int(a); --i)
#define rec(i,a,b,c) for(int i=int(a); i<=int(b); i+=int(c))
#define recv(i,a,b,c) for(int i=int(a); i>=int(b); i-=int(c))
#define mp(x,y) make_pair((x),(y))
#define pb(x) push_back(x)
#define all(c) c.begin(), c.end()
#define tr(container, it) for(auto it=(container).begin(); it != (container).end(); ++it)
#define sqr(x) ((x)*(x))
#define sz(a) int((a).size())
#define mod(a,n) ((a) < 0 ? ((n)+(a)) : ((a)%(n)))
#define mout(M,n,m) rep(i,0,(n)-1){ rep(j,0,(m)-1) cout << (M)[i][j] << " ";  cout << "\n"; }
using namespace std;

typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;

void insert_into_deque(vector<ll> arr, deque<ll> &dq, ll pos){
    while(!dq.empty() && arr[dq.back()] > arr[pos]){
        dq.pop_back();
    }
    dq.push_back(pos);
}

ll sumKMin(vector<ll> arr, ll n, ll k){
    ll sum = 0;
    if(k > n)
        return *min_element(arr.begin(), arr.end());
    deque<ll> dq;
    for(ll i=0; i<k; ++i){
        insert_into_deque(arr, dq, i);
    }
    sum += arr[dq.front()];
    for(ll i=k; i<n; ++i){
        if(!dq.empty() && i-k+1 > dq.front())
            dq.pop_front();
        insert_into_deque(arr, dq, i);
        sum += arr[dq.front()];
    }
    return sum;
}


int main(){

  freopen("deque.in", "r", stdin);
  freopen("deque.out", "w", stdout);

  ll n,k;
  scanf("%lld %lld", &n, &k);
  vector<ll> A(n);
  for(ll i=0; i<n; ++i)
    scanf("%lld", &A[i]);

  printf("%lld\n", sumKMin(A,n,k));

  return 0;
}