///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <unistd.h>
#include <time.h>
#include <sys/time.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define S static

#define rep(i,n) for(ll i=0LL; i<n; ++i)
#define srep(i,s,n) for(ll i=s; i<n; ++i)
#define rrep(i,n) for(ll i=n-1LL; i>=0LL; --i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define CIN(x) do { \
        assert(!cin.eof()); \
        cin >> x; \
        assert(!cin.fail()); \
} while(0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef __int128_t ll128;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T> >;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T>
void incr_m(map<TT, T> &m, TT k)
{
    if (m.find(k) == m.end()) m[k] = 0;
    m[k]++;
}

void llin(ll &a)
{
    CIN(a);
}

void llinl1(V<ll> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a;
        CIN(a);
        v.push_back(a);
    }
}

void llinl2(V<t2> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b;
        CIN(a >> b);
        v.push_back(t2(a, b));
    }
}

void llinl3(V<t3> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c;
        CIN(a >> b >> c);
        v.push_back(t3(a, b, c));
    }
}

void llinl4(V<t4> &v, ll count)
{
    for (ll i = 0LL; i < count; ++i) {
        ll a, b, c, d;
        CIN(a >> b >> c >> d);
        v.push_back(t4(a, b, c, d));
    }
}

void llina(V<ll> &v, ll count)
{
    llinl1(v, count);
}

template <typename T>
void sort(V<T> &v)
{
    sort(v.begin(), v.end());
}

template <typename T>
void sort_reverse(V<T> &v)
{
    sort(v.begin(), v.end(), greater<T>());
}

t2 _ext_gcd(ll a, ll b, ll g)
{
    if (!b) return t2(1, 0);
    ll q = a / b;
    ll r = a % b;
    t2 sol = _ext_gcd(b, r, g);
    ll sx = get<0>(sol);
    ll sy = get<1>(sol);
    ll x = sy;
    ll y = sx - q * sy;
    return t2(x, y);
}

t2 ext_gcd(ll a, ll b)
{
    return _ext_gcd(a, b, gcd(a, b));
}

// x and mod must be coprime
ll mod_inv(ll x, ll mod)
{
    t2 result = ext_gcd(x, mod);
    ll ret = get<0>(result);
    while (ret < 0) ret += mod;
    ret %= mod;
    return ret;
}

ll msec()
{
    struct timeval tv;
    gettimeofday(&tv, NULL);
    ll ret = 0;
    ret += tv.tv_sec * 1000LL;
    ret += tv.tv_usec / 1000LL;
    return ret;
}


template <typename T>
void _debug_print(T x)
{
    cout << x << " ";
}

void _debug_print(const t2 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    cout << "(" << x1 << ", " << x2 << ") ";
}

void _debug_print(const t3 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    cout << "(" << x1 << ", " << x2 << ", " << x3 << ") ";
}

void _debug_print(const t4 &x)
{
    ll x1 = get<0>(x);
    ll x2 = get<1>(x);
    ll x3 = get<2>(x);
    ll x4 = get<3>(x);
    cout << "(" << x1 << ", " << x2 << ", " << x3 << ", " << x4 << ") ";
}

template <typename T>
void _debug_print(T xarray[], ll n)
{
    rep (i, n) _debug_print(xarray[i]);
    cout << endl;
}

template <typename T>
void _debug_print(const V<T> &xlist)
{
    for (auto x : xlist) _debug_print(x);
    cout << endl;
}

template <typename T>
void _debug_print(const set<T> &xset)
{
    for (auto x : xset) _debug_print(x);
    cout << endl;
}

template <typename TT, typename T>
void _debug_print(const map<TT, T> &xlist)
{
    for (auto x : xlist) {
        TT k = x.first;
        T v = x.second;
        cout << "K=";
        _debug_print(k);
        cout << " V=";
        _debug_print(v);
        cout << endl;
    }
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main()
{
    cout << setprecision(12);
#if !DEBUG
    ios::sync_with_stdio(false);
    cin.tie(0);
#endif

    _main();
    return 0;
}

#define WALL  ((ll)(1e9) + 10LL)
;

ll calc(const V<ll> &alist, const V<ll> &borders, const V<ll> &leftsums, const V<ll> &rightsums, ll n, ll k, ll x)
{
    if (x < alist[0]) return 1e18;
    if (x > alist[n-1]) return 1e18;

    auto iter = lower_bound(ALL(borders), x);
    ll bpos = iter - borders.begin();

    ll ret = 1e18;

    srep (pos, bpos-3, bpos+3) {
        if (pos < 0) continue;
        if (pos > n-k) continue;

        auto iter2 = lower_bound(ALL(alist), x);
        ll pos2 = iter2 - alist.begin();
        if (pos2 < pos) continue;
        if (pos2 > pos+k) continue;

        ll left = rightsums[pos];
        left -= (WALL - x) * pos;
        ll center0 = rightsums[pos2] - rightsums[pos];
        center0 -= (WALL - x) * (pos2 - pos);
        ll center1 = leftsums[pos+k] - leftsums[pos2];
        center1 -= (x + WALL) * (pos+k - pos2);
        ll right = leftsums[n] - leftsums[pos+k];
        right -= (x + WALL) * (n - (pos+k));

        ll lans = center0 + center1 - left - right;

        if (lans == -29) {
            debug_printf("x=%lld bpos=%lld pos=%lld pos2=%lld\n", x, bpos, pos, pos2);
        }

        ret = min(ret, lans);
    }

    return ret;
}

void _main()
{
    ll n; llin(n);
    ll k; llin(k);
    V<ll> alist; llina(alist, n);

    V<ll> leftsums;
    ll sum = 0;
    leftsums.pb(sum);
    for (auto a : alist) {
        ll sub = a + WALL;
        sum += sub;
        leftsums.pb(sum);
    }
    debug_printf("---- leftsums\n");
    debug_print(leftsums);

    V<ll> rightsums;
    sum = 0;
    rightsums.pb(sum);
    for (auto a : alist) {
        ll sub = WALL - a;
        sum += sub;
        rightsums.pb(sum);
    }
    debug_printf("---- rightsums\n");
    debug_print(rightsums);

    V<ll> borders;
    rep (i, n-k) {
        ll left = alist[i];
        ll right = alist[i+k];
        borders.pb((left + right) / 2LL);
    }

    ll ans = 1e18;

    for (auto a : alist) {
        ans = min(ans, calc(alist, borders, leftsums, rightsums, n, k, a-1LL));
        ans = min(ans, calc(alist, borders, leftsums, rightsums, n, k, a));
        ans = min(ans, calc(alist, borders, leftsums, rightsums, n, k, a+1LL));
    }
    for (auto a : borders) {
        ans = min(ans, calc(alist, borders, leftsums, rightsums, n, k, a-1LL));
        ans = min(ans, calc(alist, borders, leftsums, rightsums, n, k, a));
        ans = min(ans, calc(alist, borders, leftsums, rightsums, n, k, a+1LL));
    }

    debug_printf("---- ans\n");
    cout << ans << endl;
}

///////////////////////////////////////////////////////////////////////////////