def main(): from math import sqrt,sin,cos,tan,ceil,radians,floor,gcd,exp,log,log10,log2,factorial,fsum from heapq import heapify, heappop, heappush from bisect import bisect_left, bisect_right from copy import deepcopy import copy import random from collections import deque,Counter,defaultdict from itertools import permutations,combinations from decimal import Decimal,ROUND_HALF_UP #tmp = Decimal(mid).quantize(Decimal('0'), rounding=ROUND_HALF_UP) from functools import lru_cache, reduce #@lru_cache(maxsize=None) from operator import add,sub,mul,xor,and_,or_,itemgetter INF = 10**18 mod1 = 10**9+7 mod2 = 998244353 #DecimalならPython #再帰ならPython!!!!!!!!!!!!!!!!!!!!!!!!!! ''' ''' N,K = map(int, input().split()) A = list(map(int, input().split())) A.sort() h = INF l = -1 while h-l > 1: m = (h+l)//2 mx = -INF mi = INF cnt = 0 for i in range(N): mx = max(A[i],mx) mi = min(A[i],mi) if mx-mi > m: cnt += 1 mx = A[i] mi = A[i] cnt += 1 if cnt > K: l = m else: h = m ans = INF for k in range(l,l+500): if k < 0: continue mx = -INF mi = INF cnt = 0 tmp = 0 ls = [] for i in range(N): mx = max(A[i],mx) mi = min(A[i],mi) if mx-mi > k: cnt += 1 tmp += max(ls)-min(ls) mx = A[i] mi = A[i] ls = [] ls.append(A[i]) tmp += max(ls)-min(ls) cnt += 1 if cnt == K: ans = min(ans,tmp) print(ans) if __name__ == '__main__': main()