#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
using namespace std;
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//namespace mp=boost::multiprecision;
//#define mulint mp::cpp_int
//#define mulfloat mp::cpp_dec_float_100
//#include<atcoder/all>
//using namespace atcoder;
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}} __init;
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define INF (1<<30)
#define LINF (lint)(1LL<<56)
#define endl "\n"
#define rep(i,n) for(lint (i)=0;(i)<(n);(i)++)
#define reprev(i,n) for(lint (i)=(n-1);(i)>=0;(i)--)
#define flc(x) __builtin_popcountll(x)
#define pint pair<int,int>
#define pdouble pair<double,double>
#define plint pair<lint,lint>
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define vec vector<lint>
#define nep(x) next_permutation(all(x))
typedef long long lint;
//typedef __int128_t llint;
int dx[8]={1,1,0,-1,-1,-1,0,1};
int dy[8]={0,1,1,1,0,-1,-1,-1};
const int MAX_N=3e5+5;
//vector<int> bucket[MAX_N/1000];
constexpr int MOD=1000000007;
//constexpr int MOD=998244353;

int main(void){
    lint N,K;
    cin >> N >> K;
    lint A[N];
    rep(i,N) cin >> A[i];
    lint lo=A[0];
    rep(i,N) A[i]-=lo;
    lint ans=0;
    rep(i,K) ans+=A[i];
    for(int i=K;i<N;i++) ans-=A[i];
    lint cmp=0;
    lint hi=A[N-1];
    rep(i,K) cmp+=abs(hi-A[N-1-i]);
    for(int i=K;i<N;i++) cmp-=abs(hi-A[N-1-i]);
    ans=min(ans,cmp);
    lint x=A[N/2];
    vector<lint> nums;
    rep(i,N) nums.push_back(abs(A[i]-x));
    sort(all(nums));
    cmp=0;
    rep(i,K) cmp+=nums[i];
    for(int i=K;i<N;i++) cmp-=nums[i];
    ans=min(ans,cmp);
    cout << ans << endl;
}