P1678 烦恼的高考志愿 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
n, m = map(int,input().split())
l1 = list(map(int,input().split()))
l2 = list(map(int,input().split()))
l1.sort()
num = 0
def binary(value):
ans = 1000001
l = 0
r = len(l1)-1
while l <= r:
mid = (l+r)//2
if value < l1[mid]:
r = mid-1
else:
l = mid+1
ans = min(abs(l1[mid]-value),ans)
return ans
for value in l2:
num += binary(value)
print(num)