n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()

prefix = [0] * (n + 1)
for i in range(n):
    prefix[i + 1] = prefix[i] + a[i]

min_sum = float('inf')
sum_greater = prefix[n] - prefix[k]

for j in range(n):
    a_j = a[j]
    if k == 0:
        sum_left = 0
    else:
        if j >= k:
            sum_left = k * a_j - prefix[k]
        else:
            sum_left = prefix[k] - 2 * prefix[j] + (2 * j - k) * a_j
    sum_right = sum_greater - (n - k) * a_j
    total = sum_left - sum_right
    if total < min_sum:
        min_sum = total

print(min_sum)