import math

N, K = [int(x) for x in input().split()]
boots = [int(x) for x in input().split()]

boots.sort()
s = 0

if N % 2 == 1:
	mid = int(math.ceil(len(boots) / 2))-1
	print(boots[mid])
	for i in range(mid):
		s += abs(boots[mid+i+1]-(boots[mid]+(i+1)*4))
		s += abs((boots[mid]-(i+1)*4)-boots[mid-i-1])
else:
	mid = int(math.ceil(len(boots) / 2))-1
	print(boots[mid])
	for i in range(mid):
		s += abs((boots[mid]+(i+1)*4)-boots[mid+i+1])
		s += abs((boots[mid]-(i+1)*4)-boots[mid-i-1])
	s += abs((boots[mid]+(mid+1)*4)-boots[mid+mid+1])
print(abs(s))