import java.io.BufferedReader import java.io.InputStream import java.io.InputStreamReader import java.lang.AssertionError import java.util.* import kotlin.math.abs import kotlin.math.max import kotlin.math.min val MOD = 1_000_000_007 class Solver(stream: InputStream, private val out: java.io.PrintWriter) { private val reader = BufferedReader(InputStreamReader(stream), 32768) private val N = ni() private val K = ni() private val A = nal(N) fun solve() { fun sumL() = (0 until N).map{A[it] - A[0]}.sum() fun sumR() = (0 until N).map{A.last() - A[it]}.sum() if (K == N) { out.println(min(sumL(), sumR())) return } if (K == 0) { out.println(min(-sumL(), -sumR())) return } var lsum = 0L var lcnt = 0 var rsum = 0L var sum = 0L for (i in 1 until N) { sum += A[i] - A[0] } for (i in K until N) { rsum += A[i] - A[0] } var rcnt = N - K var l = -1 var r = K debug{"$sum $rsum $rcnt"} var ans = 2e18.toLong() + 100 for (i in 0 until N) { val lstMove = if (i == 0) 0 else A[i] - A[i-1] lsum += lcnt*lstMove rsum -= rcnt*lstMove sum += i*lstMove - (N - i)*lstMove while (i >= r || (l + 1 < i && r < N && abs(A[l + 1] - A[i]) > abs(A[r] - A[i]))) { lcnt++ rcnt-- lsum += abs(A[l + 1] - A[i]) rsum -= abs(A[r] - A[i]) l++ r++ } val v = sum - lsum*2-rsum*2 debug{"$i $sum $l:$r $lsum $lcnt $rsum $rcnt $v"} ans = min(ans, v) } out.println(ans) } private val isDebug = try { // なんか本番でエラーでる System.getenv("MY_DEBUG") != null } catch (t: Throwable) { false } private var tokenizer: StringTokenizer? = null private fun next(): String { while (tokenizer == null || !tokenizer!!.hasMoreTokens()) { tokenizer = StringTokenizer(reader.readLine()) } return tokenizer!!.nextToken() } private fun ni() = next().toInt() private fun nl() = next().toLong() private fun ns() = next() private fun na(n: Int, offset: Int = 0): IntArray { return IntArray(n) { ni() + offset } } private fun nal(n: Int, offset: Int = 0): LongArray { val res = LongArray(n) for (i in 0 until n) { res[i] = nl() + offset } return res } private fun na2(n: Int, offset: Int = 0): Array { val a = Array(2){IntArray(n)} for (i in 0 until n) { for (e in a) { e[i] = ni() + offset } } return a } private inline fun debug(msg: () -> String) { if (isDebug) System.err.println(msg()) } private inline fun debug(a: LongArray) { debug { a.joinToString(" ") } } private inline fun debug(a: IntArray) { debug { a.joinToString(" ") } } private inline fun debug(a: BooleanArray) { debug { toString(a) } } private inline fun toString(a: BooleanArray) = run{a.map { if (it) 1 else 0 }.joinToString("")} private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } private inline fun debugDim(A: Array) { if (isDebug) { for (a in A) { debug(a) } } } /** * 勝手にimport消されるのを防ぎたい */ private fun hoge() { min(1, 2) max(1, 2) abs(-10) } private inline fun assert(b: Boolean) = run{if (!b) throw AssertionError()} } fun main() { val out = java.io.PrintWriter(System.out) Solver(System.`in`, out).solve() out.flush() }