import bisect
N,K=map(int,input().split())
a=sorted(list(map(int,input().split())))
lst=[]
for i in range(N-1):
  num=a[i+1]-a[i]
  bisect.insort(lst,num)
print(sum(lst[0:N-K]))