input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int, input().split()))#駒の数N,地点の数M
xList = [int(i) for i in input().split()]
xList.sort()#地点座標xList
distanse_list = []
#駒の数が座標の数以上のとき動かす必要がない
if N > M:
N = M
if N == M:
print("0")
#
else:
for i in range(len(xList)-1):
distanse = xList[i+1] - xList[i]
distanse_list.append(distanse)
distanse_list.sort()
print((sum(distanse_list[0:int(M - N)]))) | N,M = map(int, input().split())
X = list(map(int,input().split()))
X.sort()
def solve():
ans = 0
if(N>=M):
return print(ans)
else:
sub = []
for i in range(M-1):
sub_next = abs(X[i+1]-X[i])
sub.append(sub_next)
sub.sort()
return print(sum(sub[0:M-N]))
solve()
| p03137 |
n,m = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
if m <= n:
print((0))
else:
Dif_X = []
for i in range(m-1):
Dif_X += [X[i+1]-X[i]]
count = 0
while count < n-1:
Dif_X[Dif_X.index(max(Dif_X))] = 0
count += 1
print((sum(Dif_X))) | n,m = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
if m <= n:
print((0))
else:
Dif_X = []
for i in range(m-1):
Dif_X += [X[i+1]-X[i]]
Sum_Dif_X = sum(Dif_X)
Sorted_Dif_X = sorted(Dif_X, reverse = True)
count = 0
while count < n-1:
Sum_Dif_X -= Sorted_Dif_X[count]
count += 1
print(Sum_Dif_X) | p03137 |
n,m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
l = [0] * (m-1)
ans = 0
if n < m:
for i in range(m-1):
l[i] = x[i+1] - x[i]
for _ in range(m-n):
ans += min(l)
l.pop(l.index(min(l)))
print(ans) | n,m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
l = [0] * (m-1)
if n >= m:
print((0))
exit()
else:
for i in range(m-1):
l[i] = x[i+1] - x[i]
print((sum(sorted(l)[:m-n]))) | p03137 |
import sys
N, M = (int(i) for i in input().split())
X = [int(i) for i in input().split()]
X.sort()
pos = [[0] * 2 for i in range(N)]
total = 0
if M <= N:
print((0))
sys.exit()
for i in range(N):
pos[i][0] = i
pos[i][1] = abs(X[i+1] - X[i])
total = total + pos[i][1]
pos = sorted(pos, key=lambda x:(x[1]))
for j in range(N, M-1):
dim = abs(X[j+1]-X[j])
total = total + dim
if pos[0][1] < dim:
pos[0][0] = j
pos[0][1] = dim
pos = sorted(pos, key=lambda x:(x[1]))
for i in range(1, N):
total = total - pos[i][1]
print(total)
| import sys
N, M = (int(i) for i in input().split())
X = [int(i) for i in input().split()]
X.sort()
L = []
for i in range(1, M):
L.append(X[i]-X[i-1])
L = sorted(L, reverse=True)
print((X[M-1]-X[0]-sum(L[:N-1])))
| p03137 |
# ABC117C - Streamline
def main():
n, m = list(map(int, input().split()))
lst = sorted(set(map(int, input().split())))
dis = []
for i, j in zip(lst, lst[1:]):
dis += [j - i]
print((sum(sorted(dis, reverse=True)[n - 1 :])))
if __name__ == "__main__":
main()
| # ABC117C - Streamline
def main():
N, M, *X = list(map(int, open(0).read().split()))
X = sorted(set(X))
dist = []
for i, j in zip(X, X[1:]):
dist.append(j - i)
dist.sort(reverse=1)
ans = sum(dist[N - 1 :])
print(ans)
if __name__ == "__main__":
main() | p03137 |
# ABC117C - Streamline
def main():
N, M, *X = list(map(int, open(0).read().split()))
X = sorted(set(X))
dist = []
for i, j in zip(X, X[1:]):
dist.append(j - i)
dist.sort(reverse=1)
ans = sum(dist[N - 1 :])
print(ans)
if __name__ == "__main__":
main() | # ABC117C - Streamline
def main():
N, M, *X = list(map(int, open(0).read().split()))
X = sorted(set(X))
dist = [j - i for i, j in zip(X, X[1:])]
dist.sort(reverse=1)
ans = sum(dist[N - 1 :])
print(ans)
if __name__ == "__main__":
main() | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
difX = []
for i in range(len(X)-1):
difX.append(X[i+1]-X[i])
if M > N:
for i in range(N-1):
difX.pop(difX.index(max(difX)))
total = 0
for x in difX:
total+= x
print(total)
else:
print((0)) | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
difX = []
for i in range(len(X)-1):
difX.append(X[i+1]-X[i])
difX.sort(reverse=True)
if M > N:
difX = difX[N-1:]
total = 0
for x in difX:
total+= x
print(total)
else:
print((0)) | p03137 |
def _solve(current, n, idx, x):
if n >= len(x) - idx:
return 0
if n == 0:
return x[-1] - current
if current is None:
return solve(x[idx], n - 1, idx + 1, x)
a = x[idx] - current + solve(x[idx], n, idx + 1, x)
b = solve(x[idx], n - 1, idx + 1, x)
return min(a, b)
def solve(n, m, x):
if n >= m:
return 0
dp = [[0 for _ in range(n + 1)] for _ in range(m)]
dp[m-1][0] = x[-1] - x[-2]
for i in range(1, n + 1):
dp[m-1][i] = 0
for idx in reversed(list(range(m - 1))):
for i in range(n + 1):
if i >= m - idx + 1:
dp[idx][i] = 0
elif i == 0:
dp[idx][i] = x[-1] - x[idx-1]
elif idx == 0:
dp[idx][i] = dp[idx+1][i-1]
else:
a = x[idx] - x[idx - 1] + dp[idx+1][i]
b = dp[idx+1][i-1]
dp[idx][i] = min(a, b)
return dp[0][n]
def main():
n, m = list(map(int, input().split()))
x = [int(s) for s in input().split()]
x.sort()
print((solve(n, m, x)))
main()
| def solve(n, m, x):
if n >= m:
return 0
y = [x[i + 1] - x[i] for i in range(m - 1)]
y.sort(reverse=True)
return x[-1] - x[0] - sum(y[:n-1])
def main():
n, m = list(map(int, input().split()))
x = [int(s) for s in input().split()]
x.sort()
print((solve(n, m, x)))
main()
| p03137 |
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
x_diff = []
for i in range(1,m):
x_diff.append(x[i]-x[i-1])
x_diff.sort()
if n >= m:
print((0))
else:
for j in range(1,n):
x_diff.remove(x_diff[-1])
print((sum(x_diff))) | n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
x_diff = [x[i]-x[i-1] for i in range(1,m)]
x_diff.sort(reverse = True)
if n >= m:
print((0))
else:
del x_diff[:n-1]
print((sum(x_diff))) | p03137 |
def makelist(n, m):
return [[0 for _ in range(m)] for _ in range(n)]
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
hoge = [0]*(M-1)
for i in range(1, M):
hoge[i-1] = X[i] - X[i-1]
hoge = list(reversed(sorted(hoge)))
ans = sum(hoge)
if N >= M:
ans = 0
else:
for i in range(N-1):
ans -= hoge[i]
print(ans)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = list(sorted(X))
Y = [0]*(M-1)
for i in range(M-1):
Y[i] = X[i+1] - X[i]
Y = list(reversed(sorted(Y)))
ans = sum(Y) - sum(Y[:N-1])
print(ans)
| p03137 |
def nyu():
N, M = list(map(int, input().split()))
X = list(map(int,input().split()))
X.sort()
return N,M,X
def kansu(N,M,X):
x_abs = [X[m+1] -X[m] for m in range(M-1)]
# print(x_abs)
cnt_n = N
while cnt_n-1 > 0:
x_abs[x_abs.index(max(x_abs))] = 0
cnt_n -= 1
koma_max = 0
for m in range(M-1):
koma_max += x_abs[m]
print(koma_max)
N,M,X = nyu()
#print(X)
if M == 1:
print((0))
else:
kansu(N,M,X)
#print(S)
| def nyu():
N, M = list(map(int, input().split()))
X = list(map(int,input().split()))
X.sort()
return N,M,X
def kansu(N,M,X):
x_abs = [X[m+1] -X[m] for m in range(M-1)]
# print(x_abs)
x_abs.sort()
koma_max = 0
for m in range(M-N):
koma_max += x_abs[m]
print(koma_max)
N,M,X = nyu()
#print(X)
if M == 1:
print((0))
else:
kansu(N,M,X)
#print(S)
| p03137 |
n,m=list(map(int,input().split()))
x=sorted(list(map(int,input().split())));#print(x)
if n>=m:
print((0))
exit(0)
else:
x_distance=[]
for i in range(m-1):
x_distance.append(x[i+1]-x[i])
x_distance.sort();print((sum(x_distance[:m-n])))
exit(0) | def mi():return list(map(int,input().split()))
n,m=mi()
x=sorted(list(mi()))
d=sorted([x[i+1]-x[i] for i in range(m-1)])
print((sum(d[:max(m-n,0)]))) | p03137 |
n, m = list(map(int, input().split()))
L = sorted(map(int, input().split()))
d = [0] * (m - 1)
for i in range(1, m):
d[i - 1] = abs(L[i] - L[i - 1])
d = sorted(d, reverse=True)[(n - 1):]
print((sum(d)))
| n, m = list(map(int, input().split()))
L = sorted(map(int, input().split()))
d = [L[i + 1] - L[i] for i in range(m - 1)]
d.sort(reverse=True)
print((sum(d[(n - 1):])))
| p03137 |
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x = sorted(x)
if m<=n:
print((0))
else:
dif = []
for i in range(m-1):
dif.append(x[i+1]-x[i])
dif = sorted(dif)
print((sum(dif[:m-n]))) | n,m = list(map(int,input().split()))
x = sorted(list(map(int,input().split())))
dif = []
for i in range(m-1):
dif.append(x[i+1]-x[i])
dif.sort()
print((sum(dif[:max(m-n,0)]))) | p03137 |
### C
N , M = list(map(int , input().split()))
X = list(map(int , sorted(list(map(int , input().split())))))
#print("X = " + str(X))
D = []
R = 0
if M-1 > 0 :
for i in range(M-1):
D.append(int(X[i+1]) - int(X[i]))
#print("D = " + str(D))
for i in range(N-1):
if D !=[]:
MAXD = max(D)
D.remove(MAXD)
# print(str(D) + "minus " + str(i+1) + "roots.")
if D != []:
for d in D:
R += d
print(R)
| ### C
N , M = list(map(int , input().split()))
X = list(map(int , sorted(list(map(int , input().split())))))
#print("X = " + str(X))
D = []
R = 0
if M-1 > 0 :
for i in range(M-1):
D.append(int(X[i+1]) - int(X[i]))
#print("D = " + str(D))
if D !=[]:
D = sorted(D)
D = D[::-1]
D = D[N-1:]
#print("D = " + str(D))
if D != []:
for d in D:
R += d
print(R)
| p03137 |
N, M = [int(i) for i in input().split()]
XS = [int(i) for i in input().split()]
if M < N:
print((0))
else:
xs = sorted(XS)
ds = list(map(lambda a,b: b-a, xs, xs[1:]))
for _ in range(N-1):
ds.remove(max(ds))
print((sum(ds)))
| N, M = [int(i) for i in input().split()]
XS = [int(i) for i in input().split()]
if M <= N:
print((0))
else:
xs = sorted(XS)
ds = list(map(lambda a,b: b-a, xs, xs[1:]))
print((sum(sorted(ds)[:M-N])))
| p03137 |
N,M = list(map(int,input().split()))
X=[int(i) for i in input().split()]
X.sort()
Y=list()
for i in range(M)[1:]:
Y.append(X[i]-X[i-1])
Y.sort()
if N==1:
print((sum(Y)))
else:
print((sum(Y[:-(N-1)]))) | N,M = list(map(int,input().split()))
X=[int(i) for i in input().split()]
X.sort()
if N==1:
print((X[M-1]-X[0]))
else:
Y=list()
[Y.append(X[i]-X[i-1]) for i in range(M)[1:]]
Y.sort()
print((sum(Y[:-(N-1)])))
| p03137 |
N,M = list(map(int,input().split()))
X=[int(i) for i in input().split()]
X.sort()
if N==1:
print((X[M-1]-X[0]))
elif N>=M:
print((0))
else:
Y=list()
[Y.append(X[i]-X[i-1]) for i in range(M)[1:]]
Y.sort()
print((sum(Y[:-(N-1)])))
| N,M = list(map(int,input().split()))
X=sorted([int(i) for i in input().split()])
if N==1:
print((X[M-1]-X[0]))
elif N>=M:
print((0))
else:
Y=list()
[Y.append(i-j) for i,j in zip(X[1:],X)]
Y.sort(reverse=True)
print((sum(Y[N-1:])))
| p03137 |
N,M = list(map(int,input().split()))
X=sorted([int(i) for i in input().split()])
if N==1:
print((X[M-1]-X[0]))
elif N>=M:
print((0))
else:
Y=list()
[Y.append(i-j) for i,j in zip(X[1:],X)]
Y.sort(reverse=True)
print((sum(Y[N-1:])))
| N,M = list(map(int,input().split()))
X=sorted([int(i) for i in input().split()])
if N==1:
print((X[M-1]-X[0]))
elif N>=M:
print((0))
else:
print((sum(sorted([i-j for i,j in zip(X[1:],X)],reverse=True)[N-1:])))
| p03137 |
N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
X.sort()
diff=[]
for i in range(M-1):
diff.append(X[i+1]-X[i])
gap=[]
for i in range(N-1):
for j in range(M-1):
x=diff.index(max(diff))
gap.append(x)
diff[x]=0
break
gap.append(M-1)
gap=list(set(gap))
gap.sort()
offset=0
cnt=0
for i in gap:
cnt+=X[i]-X[offset]
offset=i+1
print(cnt) | N,M=list(map(int,input().split()))
X=list(map(int,input().split()))
X.sort()
diff=[]
for i in range(M-1):
diff.append(X[i+1]-X[i])
diff.sort()
to=M-N
if to<=0:
ans=0
else:
ans=sum(diff[:to])
print(ans) | p03137 |
n, m = list(map(int, input().split()))
l = list(map(int, input().split()))
if n >= m:
print((0))
exit()
l.sort()
d = [0]*(m-1)
for i in range(m-1):
d[i] = l[i+1] - l[i]
d.sort()
print((sum(d[0:(m-n)])))
| n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
if n >= m:
print((0))
exit()
X.sort()
if n == 1:
print((X[-1]-X[0]))
exit()
Y = []
for i in range(m-1):
Y.append(X[i+1]-X[i])
#print(Y)
Y.sort()
ans = sum(Y[0:-(n-1)])
print(ans)
| p03137 |
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x = sorted(x)
d = []
for i in range(len(x)-1):
d.append(x[i+1]-x[i])
if n==1:
print((x[-1]-x[0]))
elif n>=len(x):
print((0))
else:
for i in range(n-1):
d.remove(max(d))
print((sum(d))) | n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x = sorted(x)
d = []
for i in range(len(x)-1):
d.append(x[i+1]-x[i])
d = sorted(d)
if n==1:
print((x[-1]-x[0]))
elif n>=len(x):
print((0))
else:
dis = 0
for i in range(n-1):
dis+=d[-i-1]
print((sum(d)-dis)) | p03137 |
N, M = list(map(int, input().split()))
X = list(sorted(map(int, input().split())))
if N >= M:
print('0')
else:
d = []
for i in range(M - 1):
d.append(X[i + 1] - X[i])
for j in range(N - 1):
d.remove(max(d))
print((sum(d))) | N, M = list(map(int, input().split()))
X = list(sorted(map(int, input().split())))
if N >= M:
print('0')
else:
d = []
ans = X[-1] - X[0]
for i in range(M - 1):
d.append(X[i + 1] - X[i])
ans -= sum(list(sorted(d, reverse=True))[0:N - 1])
print(ans) | p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
if n >= m:
print((0))
else:
diff = [x[i+1]-x[i] for i in range(m-1)]
diff.sort()
for i in range(n-1):
diff.pop()
print((sum(diff))) | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
if n >= m:
print((0))
else:
diff = [x[i+1]-x[i] for i in range(m-1)]
diff.sort()
print((sum(diff[0:m-n]))) | p03137 |
#!/usr/bin/env python3
#ABC117 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,m = LI()
x = LI()
x.sort()
if n >= m:
print((0))
quit()
y = [abs(x[i] - x[i+1]) for i in range(m-1)]
y.sort()
ans = sum(y[:m-n])
print(ans)
| #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n,m = LI()
x = LI()
x.sort()
lst = []
for i in range(m-1):
lst.append(x[i+1]-x[i])
lst.sort(reverse=1)
if n >= m:
print((0))
quit()
print((sum(lst[n-1:]))) | p03137 |
#x=int(input())
n,m=list(map(int,input().split()))
xl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
ans=0
if n>=m:
pass
else:
cum=[]
xl.sort()
ans=xl[m-1]-xl[0]
for i in range(m-1):
cum.append(xl[i+1]-xl[i])
cum.sort(reverse=True)
for i in range(n-1):
ans-=cum[i]
print(ans) | #n = int(input())
n, m = list(map(int, input().split()))
xl = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]
xl.sort()
difl = []
for i in range(1, m):
difl.append(xl[i]-xl[i-1])
difl.sort(reverse=True)
if n >= m:
ans = 0
else:
ans = xl[-1]-xl[0]-sum(difl[:n-1])
print(ans) | p03137 |
# -*- coding: utf-8 -*-
def main():
n, m = list(map(int, input().split()))
xs = sorted(list(map(int, input().split())))
if n >= m:
print((0))
else:
ans = xs[-1] - xs[0]
diff = [0 for _ in range(m - 1)]
for i in range(m - 1):
diff[i] = xs[i + 1] - xs[i]
print((ans - sum(sorted(diff, reverse=True)[:n - 1])))
if __name__ == '__main__':
main()
| # -*- coding: utf-8 -*-
def main():
n, m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
diff = list()
for i, j in zip(x, x[1:]):
diff.append(abs(i - j))
diff = sorted(diff, reverse=True)
print((sum(diff) - sum(diff[:n - 1])))
if __name__ == '__main__':
main()
| p03137 |
n, m = tuple(map(int, input().split()))
x = list(map(int, input().split()))
x = sorted(x)
diff = []
for i in range(len(x) - 1):
diff.append(x[i + 1] - x[i])
diff = sorted(diff)
diff_sum = 0
diff_len = m - 1
for i in range(diff_len - (n - 1)):
diff_sum += diff[i]
print(diff_sum) | n, m = tuple(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
diff = [x[i + 1] - x[i] for i in range(len(x) - 1)]
diff.sort()
diff_sum = 0
for i in range(len(diff) - (n - 1)):
diff_sum += diff[i]
print(diff_sum)
| p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
if N >= M:
ans = 0
else:
x_diff = [X[i + 1] - X[i] for i in range(len(X) - 1)]
for _ in range(N - 1):
x_diff.remove(max(x_diff))
ans = sum(x_diff)
print(ans)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
if N >= M:
ans = 0
else:
x_diff = [xn - x for xn, x in zip(X[1:], X[:-1])] #[X[i + 1] - X[i] for i in range(len(X) - 1)]
# for _ in range(N - 1):
# x_diff.remove(max(x_diff))
x_diff.sort(reverse=True)
ans = sum(x_diff[N-1:])
print(ans)
| p03137 |
M, N = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
Y = []
for i in range(N - 1):
Y.append((i, X[i + 1] - X[i]))
Y.sort(key=lambda y: y[1], reverse=True)
Y = Y[:M - 1]
Y.sort(key=lambda y: y[0])
p = 0
c = 0
for i, y in Y:
c += X[i] - X[p]
p = i + 1
c += X[-1] - X[p]
print(c)
| M, N = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
Y = []
for i in range(N - 1):
Y.append(X[i + 1] - X[i])
Y.sort()
if M < N:
c = X[-1] - X[0] - sum(Y[N - M:])
else:
c = 0
print(c)
| p03137 |
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N >= M:
print((0))
else:
X.sort()
D = []
for i in range(M-1):
D.append(X[i+1]-X[i])
D.sort()
print((sum(D[0:M-N]))) | # Python3 (3.4.3)
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# function
# -------------------------------------------------------------
# -------------------------------------------------------------
# main
# -------------------------------------------------------------
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N >= M:
print((0))
else:
X.sort()
D = []
for i in range(M-1):
D.append(X[i+1]-X[i])
D.sort()
print((sum(D[0:M-N]))) | p03137 |
n,m = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
num = []
for i in range(1,m):
num.append(X[i]-X[i-1])
num.sort(reverse = True)
print((sum(num[n-1:]))) | n,m = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
p = []
for i in range(1,m):
p.append(X[i]-X[i-1])
p.sort(reverse=True)
#print(p)
print((sum(p[n-1:]))) | p03137 |
N, M = list(map(int, input().split()))
if N >= M:
print((0))
exit()
X = list(map(int,input().split()))
X.sort()
dX,dX1 = [],[]
for i in range(M-1):
dX.append(X[i+1]-X[i])
dX1.append(X[i+1]-X[i])
seppoint = []
for i in range(N-1):
dXmax = [j for j,v in enumerate(dX) if v == max(dX)]
if len(dXmax) > 1:
sumdist0 = 2*10**5
for k in dXmax:
dXtmp = dX[:k] + dX[k+1:]
sumdist1 = (sum(dXtmp))
if sumdist0 > sumdist1:
sumdist0 = sumdist1
dX = dXtmp
seppoint.append(k)
else:
dX = dX[:dXmax[0]] + dX[dXmax[0]+1:]
seppoint.append(dXmax[0])
print((sum(dX)))
#seppoint.sort()
#print(seppoint)
#for i in seppoint:
# dX1[i] = -1
#print(dX1)
#anslist = []
#tmpans = 0
#for i in range(len(dX1)):
# if dX1[i] == -1:
# anslist.append(tmpans)
# tmpans = 0
# else:
# tmpans += dX1[i]
# if i == len(dX1)-1:
# anslist.append(tmpans)
# tmpans = 0
# print(anslist)
#print(max(anslist)) | N, M = list(map(int, input().split()))
#if N >= M:
# print(0)
# exit()
X = list(map(int,input().split()))
X.sort()
diff = []
for i in range(1,M):
diff.append(X[i]-X[i - 1])
diff.sort()
for i in range(N - 1):
if len(diff) != 0:
diff.pop()
print((sum(diff))) | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)
diff_dict = {}
for i in range(M-1):
diff = X[i+1] - X[i]
diff_dict[i] = diff
sorted_diff = sorted(list(diff_dict.items()), key=lambda x: x[1])[::-1][:N-1]
keys = {x[0] for x in sorted_diff}
tmp = []
count = 0
for i, x in enumerate(X):
tmp.append(x)
if i in keys:
if len(tmp) > 1:
count += (max(tmp) - min(tmp))
tmp.clear()
if len(tmp) > 1:
count += (max(tmp) - min(tmp))
print(count)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X = sorted(X)
diff = []
for i in range(M-1):
diff.append(X[i+1] - X[i])
diff = sorted(diff)[::-1]
print((X[-1] - X[0] - sum(diff[:N-1]))) | p03137 |
N,M= list(map(int, input().split()))
X= list(map(int, input().split()))
X.sort()
div=[]
if N>=M:
print("0")
else:
for i in range(M-1):
div.append(X[i+1]-X[i])
for i in range(N-1):
div.pop(div.index(max(div)))
print((sum(div))) | N,M= list(map(int, input().split()))
X= list(map(int, input().split()))
X.sort()
div=[]
if N>=M:
print("0")
else:
for i in range(M-1):
div.append(X[i+1]-X[i])
div.sort()
print((sum(div[:M-N]))) | p03137 |
n, m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
if n < m:
distance = []
for i in range(m-1):
distance.append(x[i + 1] - x[i])
for _ in range(n - 1):
distance.remove(max(distance))
print((sum(distance)))
else:
print((0)) | n, m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
if n < m:
distance = []
for i in range(m-1):
distance.append(x[i + 1] - x[i])
distance.sort()
print((sum(distance[0:m-n])))
else:
print((0)) | p03137 |
n, m = (int(i) for i in input().split())
x = sorted([int(i) for i in input().split()])
if m > 1:
x_diff = []
for i in range(m-1):
x_diff.append(x[i+1] - x[i])
else:
x_diff = [0]
for i in range(n-1):
max_num = max(x_diff)
max_index = x_diff.index(max_num)
x_diff[max_index] = 0
print((sum(x_diff))) | n, m = (int(i) for i in input().split())
x = sorted([int(i) for i in input().split()])
if m > 1:
x_diff = []
for i in range(m-1):
x_diff.append(x[i+1] - x[i])
else:
x_diff = [0]
if n > 1:
x_diff = sorted(x_diff)[:-(n-1)]
print((sum(x_diff))) | p03137 |
n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
X =sorted(X)
dis = [X[i+1]-X[i] for i in range(len(X)-1)]
dis = sorted(dis)
ans = 0
for i in range(len(dis)-n+1):
ans = ans + dis[i]
print(ans) | N, M = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
dis = sorted([x[i] - x[i-1] for i in range(1, M)])
if N < M:
print((sum(dis[:M-N])))
else:
print((0)) | p03137 |
n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
C = []
if m <= n:
print((0))
exit()
for i in range(1, m):
C.append(abs(X[i] - X[i-1]))
for i in range(n-1):
t = max(C)
C[C.index(t)] = 0
print((sum(C))) | n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
C = []
if m <= n:
print((0))
exit()
for i in range(1, m):
C.append(abs(X[i] - X[i-1]))
C.sort()
for i in range(n-1):
C[m-2-i] = 0
print((sum(C))) | p03137 |
N,M = list(map(int,input().split()))
Xs = list(map(int,input().split()))
Xs.sort()
Xdivs = []
for i in range(M-1):
Xdivs.append(Xs[i+1]-Xs[i])
for _ in range(N-1):
for i,x in enumerate(Xdivs):
if Xdivs[i] == max(Xdivs):
Xdivs[i] = 0
break
print((sum(Xdivs))) | N,M = list(map(int,input().split()))
Xs = list(map(int,input().split()))
if len(Xs) <= N:
print((0))
else:
Xs.sort()
Xdivs = []
for i in range(M-1):
Xdivs.append(Xs[i+1]-Xs[i])
Xdivs.sort()
print((sum(Xdivs[:M-N]))) | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
t = sorted(X, reverse=True)
h = [0] * M
for i in range(1, M):
h[i] = abs(t[i - 1] - t[i])
for i in range(N - 1):
tmp = h.index(max(h))
h[tmp] = 0
print((sum(h))) | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
t = sorted(X, reverse=True)
h = [0] * M
for i in range(1, M):
h[i] = abs(t[i - 1] - t[i])
tmp = sorted(h, reverse=True)
print((sum(tmp[N - 1:]))) | p03137 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A=sorted(A)
B=[0]*(M-1)
for i in range(len(A)-1):
B[i]=A[i+1]-A[i]
for i in range(N-1):
if(len(B)==0):
print("0")
exit()
B.remove(max(B))
print((sum(B))) | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A=sorted(A)
B=[0]*(M-1)
for i in range(len(A)-1):
B[i]=A[i+1]-A[i]
B=sorted(B)
if(N>=M):
print("0")
exit()
else:
print((sum(B[0:M-N]))) | p03137 |
def main():
N, M = (int(i) for i in input().split())
X = [int(i) for i in input().split()]
if N >= M:
print((0))
elif N < M:
X.sort()
diff = [[0,0] for _ in range(M-1)]
for i in range(M-1):
diff[i] = [X[i+1] - X[i],i]
diff.sort(reverse=True)
diff = diff[:N-1]
diff.sort(key=lambda p:p[1])
ans = 0
cnt = 0
for i in range(N-1):
ans += X[diff[i][1]] - X[cnt]
cnt = diff[i][1] + 1
ans += X[-1] - X[cnt]
print(ans)
if __name__ == "__main__":
main() | def main():
N, M = (int(i) for i in input().split())
X = [int(i) for i in input().split()]
if N >= M:
print((0))
elif N < M:
X.sort()
diff = [0 for _ in range(M-1)]
for i in range(M-1):
diff[i] = X[i+1] - X[i]
diff.sort(reverse=True)
ans = X[-1] - X[0]
for i in range(N-1):
ans -= diff[i]
print(ans)
if __name__ == "__main__":
main() | p03137 |
import sys
# N: コマ数
# M: 地点数
N,M,*X = list(map(int, open(0).read().split()))
# コマ数が地点数以上の場合、各地点にコマを配置できる
# よって 0 回の移動で目的を達成できる
if N >= M:
print((0))
sys.exit()
X.sort()
ans = []
for i in range(M-1):
ans.append(abs(X[i+1] - X[i]))
ans.sort(reverse=True)
print((X[-1] - X[0] - sum(ans[:N-1]))) | import sys
# N: コマ数
# M: 地点数
N,M,*X = list(map(int, open(0).read().split()))
# コマ数が地点数以上の場合、各地点にコマを配置できる
# よって 0 回の移動で目的を達成できる
if N >= M:
print((0))
sys.exit()
X.sort()
ans = []
for i in range(M-1):
ans.append(abs(X[i+1] - X[i]))
print((X[-1] - X[0] - sum(sorted(ans)[::-1][:N-1]))) | p03137 |
import sys
# N: コマ数
# M: 地点数
N,M,*X = list(map(int, open(0).read().split()))
# コマ数が地点数以上の場合、各地点にコマを配置できる
# よって 0 回の移動で目的を達成できる
if N >= M:
print((0))
sys.exit()
X.sort()
D = sorted(abs(X[i+1] - X[i]) for i in range(M-1))
print((sum(D[:M-N]))) | import sys
# N: コマ数
# M: 地点数
N,M,*X = list(map(int, open(0).read().split()))
# コマ数が地点数以上の場合、各地点にコマを配置できる
# よって 0 回の移動で目的を達成できる
if N >= M:
print((0))
sys.exit()
X.sort()
D = sorted([abs(X[i+1] - X[i]) for i in range(M-1)], reverse=True)
print((X[-1] - X[0] - sum(D[:N-1]))) | p03137 |
import sys
# N: コマ数
# M: 地点数
N,M,*X = list(map(int, open(0).read().split()))
# コマ数が地点数以上の場合、各地点にコマを配置できる
# よって 0 回の移動で目的を達成できる
if N >= M:
print((0))
sys.exit()
X.sort()
D = sorted([abs(X[i+1] - X[i]) for i in range(M-1)], reverse=True)
print((X[-1] - X[0] - sum(D[:N-1]))) | N,M,*X=list(map(int,open(0).read().split()))
X.sort()
print((0 if N>=M else sum(sorted(abs(X[i+1]-X[i])for i in range(M-1))[:M-N]))) | p03137 |
n, m = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
Diffs = [0] + [X[i] - X[i-1] for i in range(1, m)]
for i in range(n-1):
m = Diffs.index(max(Diffs))
Diffs[m] = 0
print((sum(Diffs)))
| n, m = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
Diffs = [0] + [X[i] - X[i-1] for i in range(1, m)]
if n >= m:
print((0))
elif n == 1:
Diffs.sort()
print((sum(Diffs)))
else:
Diffs.sort()
print((sum(Diffs[:-(n-1)])))
| p03137 |
# -*- coding: utf-8 -*-
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
if N >= M:
print((0))
exit()
diffX = [X[i + 1] - X[i] for i in range(len(X) - 1)]
diffX.sort()
ans = X[-1] - X[0]
for i in range(N - 1):
ans -= diffX[-(i + 1)]
print(ans)
| N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
D = sorted([X[i + 1] - X[i] for i in range(M - 1)])
print((X[-1] - X[0] - sum(D[-(N - 1):]) if N > 1 else X[-1] - X[0]))
| p03137 |
[n,m] = [int(i) for i in input().split()]
x = [int(i) for i in input().split()]
x = sorted(x)
if n == 1:
print((max(x) - min(x)))
elif n >= m:
print((0))
else:
dif = []
for i in range(m-1):
dif.append(x[i+1] - x[i])
for i in range(n - 1):
dif.remove(max(dif))
print((sum(dif)))
| [n,m] = [int(i) for i in input().split()]
x = [int(i) for i in input().split()]
x = sorted(x)
if n == 1:
print((max(x) - min(x)))
elif n >= m:
print((0))
else:
dif = []
for i in range(m - 1):
dif.append(x[i+1] - x[i])
dif = sorted(dif)
dif = dif[:m-n]
print((sum(dif)))
| p03137 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
if N >= M:
print((0))
else:
A.sort()
diff = []
for i in range(M - 1):
diff.append(A[i + 1] - A[i])
diff.sort(reverse=True)
print((sum(diff[N - 1 :])))
| import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
dist = []
for i in range(1, M):
dist.append(X[i] - X[i - 1])
dist.sort(reverse=True)
if N >= M:
print((0))
else:
# N - 1個の開いた区間が出てくる
ans = sum(dist[N - 1 :])
print(ans)
if __name__ == "__main__":
main()
| p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
y = [x[i] - x[i - 1] for i in range(1, m)]
y.sort()
print((sum(y[:m-n]) if n < m else 0))
| from sys import stdin
n, m, *x = list(map(int, stdin.read().split()))
x.sort()
y = [x[i] - x[i - 1] for i in range(1, m)]
y.sort()
print((sum(y[:m - n]) if n < m else 0))
| p03137 |
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
if n>=m:
print((0))
else:
x.sort()
dx = []
for i in range(m-1):
dx.append(abs(x[i]-x[i+1]))
for i in range(n-1):
dx.remove(max(dx))
print((sum(dx))) | n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
if n>=m:
print((0))
else:
x.sort()
dx = []
for i in range(m-1):
dx.append(abs(x[i]-x[i+1]))
dx.sort()
print((sum(dx[:m-n]))) | p03137 |
N,M=list(map(int,input().split(" ")))
A=list(sorted(map(int,input().split(" "))))
L=[A[s]-A[s+1] for s in range(M-1)]
if M>N:
print((abs(sum(sorted(L)[N-1:]))))
else:
print((0)) | N,M=list(map(int,input().split(" ")))
A=list(sorted(map(int,input().split(" "))))
L=sorted([A[s]-A[s+1] for s in range(M-1)])
print((abs(sum(L[N-1:])))) | p03137 |
n,m=list(map(int,input().split()))
X=sorted(list(map(int,input().split())))
init=[]
tmp=0
i=1
if m<n:
n=m
while i<len(X):
init.append([X[i]-X[i-1],i])
i+=1
init.sort(reverse=True,key=lambda x:x[0])
init=list([x[1] for x in init])
ans=0
init=sorted(init[:n-1])
if len(init)==0:
print((X[-1]-X[0]))
exit()
tmp=0
for i in init:
ans+=(X[i-1]-X[tmp])
tmp=i
try:
if i!=len(X)-1:
ans+=X[-1]-X[i]
except IndexError:
print((0))
exit()
print(ans)
| n,m=list(map(int,input().split()))
X=sorted(list(map(int,input().split())))
ans=[]
if m<n:
print((0))
exit()
for i in range(m-1):
ans.append(X[i+1]-X[i])
ans=sorted(ans)
print((sum(ans[:m-n]))) | p03137 |
import sys
n,m = list(map(int, input().split()))
X = list(map(int, input().split()))
if n >= m:
print((0))
sys.exit(0)
X.sort()
Y = []
for i in range(len(X)-1):
Y.append(X[i+1]-X[i])
Y.sort(reverse=True)
print((X[-1]-X[0]-sum(Y[:n-1])))
| import sys
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N >= M:
print((0))
sys.exit()
X.sort() # O(MlogM)
# O(M)
D = []
for i in range(M-1):
D.append(X[i+1] - X[i])
D.sort() # O(MlogM)
print((sum(D[:M-N]))) # O(M)
| p03137 |
from itertools import accumulate
n, m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
if n >= m:
print((0))
exit()
ans = []
for i in range(m - 1, 0, -1):
ans.append(x[i] - x[i - 1])
for i in range(n - 1):
ans.remove(max(ans))
print((sum(ans)))
| from itertools import accumulate
n, m = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
if n >= m:
print((0))
exit()
ans = []
for i in range(m - 1, 0, -1):
ans.append(x[i] - x[i - 1])
ans = sorted(ans, reverse=True)
print((sum(ans[n-1:]))) | p03137 |
#C
nm_ent = list(map(int, input().split()))
n = nm_ent[0]
m = nm_ent[1]
x = list(map(int, input().split()))
x.sort()
if n >= m:
print((0))
else:
xl = []
for i in range(0, m-1):
xl.append(x[i+1] - x[i])
k = 1
while k < n:
xl.remove(max(xl))
k += 1
print((sum(xl))) | nm_ent = list(map(int, input().split()))
n = nm_ent[0]
m = nm_ent[1]
x = list(map(int, input().split()))
x.sort()
if n >= m:
print((0))
else:
xl = []
for i in range(0, m-1):
xl.append(x[i+1] - x[i])
xl.sort(reverse = True)
del xl[:n-1]
print((sum(xl))) | p03137 |
#!/usr/bin/python
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
x = sorted(X)
i = 0
diff = []
while i + 1 < len(x):
diff.append(x[i] - x[i + 1])
i += 1
d = sorted(diff)[:N - 1]
i = 0
sum = 0
for _ in x:
if i + 1 < len(x):
if x[i] - x[i + 1] in d:
d.remove(x[i] - x[i + 1])
else:
sum = sum + abs(x[i] - x[i + 1])
i += 1
print(sum) | #!/usr/bin/python
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
x = sorted(X)
i = 0
diff = []
while i + 1 < len(x):
diff.append(x[i] - x[i + 1])
i += 1
d = sorted(diff)[N - 1:]
print((abs(sum((d))))) | p03137 |
import sys
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
gap = []
if( n >= m):
print((0))
sys.exit()
else:
x = sorted(x)
for i in range(m-1):
gap.append(x[i+1] - x[i])
gaps = sorted(gap)
print((sum(gaps[:m-n])))
| import sys
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
gap = []
if( n >= m):
print((0))
sys.exit()
else:
x = sorted(x)
for i in range(m-1):
gap.append(x[i+1] - x[i])
gaps = sorted(gap)
print((sum(gaps[:m-n]))) | p03137 |
N , M = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
# 隣接点の間の距離が長い順で分割する
# おけるコマの個数-1だけ辺を取り除ける
maxDist = X[-1] - X[0]
dist = [0] * (M-1)
# 間の距離を計算
for i in range(M-1) :
dist[i] = X[i+1] - X[i]
dist.sort(reverse=True)
for i in range(min(N-1,M-1)) :
maxDist -= dist[i]
print(maxDist) | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
D = [r - l for l, r in zip(X, X[1:])]
D.sort()
ans = sum(D)
while D and N > 1:
N -= 1
ans -= D.pop()
print(ans)
| p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N >= M:
print((0))
else:
X = sorted(X)
L = []
for i in range(0, M-1):
L.append(X[i+1] - X[i])
L = sorted(L, reverse = True)
S = 0
for i in range(N-1):
S += L[i]
res = X[M-1] - X[0] - S
print(res)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
if N >= M:
print((0))
else:
X = sorted(X)
L = []
for i in range(0, M-1):
L.append(X[i+1] - X[i])
L = sorted(L, reverse = True)
S = 0
for i in range(N-1):
S += L[i]
res = X[M-1] - X[0] - S
print(res) | p03137 |
N,M = list(map(int,(input().split())))
X = list(map(int,(input().split())))
if N >= M:
print((0))
else:
X.sort()
gap = []
for i in range(1,M):
gap.append(X[i]-X[i-1])
s = X[M-1] - X[0]
gap.sort(reverse=True)
d = 0
for i in range(N-1):
d += gap[i]
print((s-d)) | N,M = list(map(int,(input().split())))
X = list(map(int,(input().split())))
if N >= M:
print((0))
else:
X.sort()
gap = []
for i in range(1,M):
gap.append(X[i]-X[i-1])
s = X[M-1] - X[0]
gap.sort(reverse=True)
print((s-sum(gap[0:N-1]))) | p03137 |
N,M=list(map(int,input().split()))
X=[int(i) for i in input().split()]
X.sort()
count=[]
sum=0
if N<M:
for i in range(M):
if i != 0:
count.append(X[i]-get)
sum+=count[i-1]
get=X[i]
count.sort(reverse=True)
if count != []:
for i in range(N-1):
sum-=count[i]
print(sum) | N,M=list(map(int,input().split()))
X=[int(i) for i in input().split()]
X.sort()
count=[]
sum=0
if N<M:
for i in range(M):
if i != 0:
count.append(X[i]-get)
sum+=count[i-1]
get=X[i]
count.sort(reverse=True)
for i in range(N-1):
sum-=count[i]
print(sum)
| p03137 |
n,m = list(map(int,input().split()))
t = list(map(int,input().split()))
t.sort()
memo = []
for i in range(m-1):
memo.append(t[i+1]-t[i])
memo.sort()
#print(memo)
ans = 0
for i in range(m-n):
#print(i)
ans += memo[i]
print(ans) | N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
memo = []
for i in range(1,M):
memo.append(X[i]-X[i-1])
memo.sort()
#print(memo)
ans = 0
for i in range(M-N):
ans += memo[i]
print(ans) | p03137 |
N, M = list(map(int, input().split()))
x_list = list(map(int, input().split()))
x_list.sort()
ans = 0
margin = [0] * (M - 1)
f = x_list[0]
for i in range(1, M):
margin[i - 1] = x_list[i] - f
f = x_list[i]
margin = sorted(enumerate(margin), key=lambda x: (-x[1], x[0]))
cnt = [0]
for i, v in margin:
if len(cnt) == N:
break
cnt.append(i + 1)
if len(cnt) == 1:
p = -1
for i, x in enumerate(x_list):
if i == 0:
p = x_list[0]
else:
ans += x_list[i] - p
p = x_list[i]
print(ans)
exit()
start = 0
prev = x_list[0]
cnt.append(M)
cnt.sort()
for i, c in enumerate(cnt[1:]):
for j in range(start, c):
ans += x_list[j] - prev
prev = x_list[j]
if c != M:
start = c
prev = x_list[c]
print(ans)
| N, M = list(map(int, input().split()))
x_list = list(map(int, input().split()))
x_list.sort()
margin = []
prev = x_list[0]
for i in range(1, M):
margin.append(x_list[i] - prev)
prev = x_list[i]
margin.sort(reverse=True)
print((x_list[-1] - x_list[0] - sum(margin[:N-1])))
| p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
x.sort()
dif = []
for i in range(m - 1):
dif.append((x[i + 1] - x[i], i + 1))
dif.sort(key = lambda x: x[0], reverse = True)
split = set()
for i in range(n - 1):
split.add(dif[i][1])
ans = 0
minn, maxx = x[0], x[0]
for i in range(m):
if i in split:
ans += maxx - minn
minn = x[i]
maxx = max(x[i], maxx)
ans += maxx - minn
print(ans) | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
if n >= m:
print((0))
exit()
x.sort()
dif = []
for i in range(m - 1):
dif.append((x[i + 1] - x[i], i + 1))
dif.sort(key = lambda x: x[0], reverse = True)
split = set()
for i in range(n - 1):
split.add(dif[i][1])
ans = x[-1] - x[0]
for i in split:
ans -= x[i] - x[i - 1]
print(ans) | p03137 |
n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
import sys
if n>m:
print((0))
sys.exit()
x.sort()
ans_list=[]
for i in range(1,m):
ans_list.append(x[i]-x[i-1])
ans_list.sort(reverse=True)
print((max(x)-min(x)-sum(ans_list[:n-1])))
| #1 コマは片方の方向に動かした方が効果的
#2 コマをはじめにおく位置は訪れるべき整数の方がよい
#3 M個の区間で覆うその長さの総和がコマの総移動距離になる
#4 M個の区間の最小値=M個の区間で覆われてない区間の最大値を最大にすればいい
#5 M個の区間で覆うということは覆われてない区間はmー１個ある
#6 よって区間の最大値を求めて上からm-1個選べばいい
n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
x.sort()
if n>=m:
print((0))
else:
h=[]
for i in range(1,m):
h.append(x[i]-x[i-1])
h.sort(reverse=True)
print((x[m-1]-x[0]-sum(h[:n-1])))
| p03137 |
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
x = []
ans = 0
X.sort()
if N >= M:
print((0))
exit()
for i in range(M-1):
x.append(abs(X[i]-X[i+1]))
xx = sorted(x,reverse=True)
for j in range(N-1):
xx[j] = 0
ans = sum(xx)
print(ans) | N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
ans = 0
if N >= M:
pass
else:
X.sort()
dist = []
for i in range(1,M):
dist.append(abs(X[i]-X[i-1]))
dist = sorted(dist, reverse= True)
ans = sum(dist[N-1:])
print(ans) | p03137 |
n, m = (int(x) for x in input().split())
x = [int(x) for x in input().split()]
if n >= m:
print((0))
else:
x.sort()
dis = [abs(x[i+1] - x[i]) for i in range(m-1)]
for _ in range(n-1): dis.remove(max(dis))
print((sum(dis))) | n, m = (int(x) for x in input().split())
x = [int(x) for x in input().split()]
if n >= m:
print((0))
else:
x.sort()
dis = [abs(x[i+1] - x[i]) for i in range(m-1)]
dis.sort()
for _ in range(n-1): dis.pop(-1)
print((sum(dis))) | p03137 |
N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
if M <= N:
print((0))
else:
Y = []
for i in range(1, len(X)):
Y.append(X[i] - X[i-1])
Y = sorted(Y)
for i in range(N - 1):
Y = Y[:-1]
print((sum(Y)))
| N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
if M <= N:
print((0))
else:
Y = []
for i in range(1, len(X)):
Y.append(X[i] - X[i-1])
Y = sorted(Y)
if N == 1:
print((sum(Y)))
else:
print((sum(Y[:-(N-1)])))
| p03137 |
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
Y = []
for i in range(M-1):
Y.append(abs(X[i]-X[i+1]))
Y.sort()
res=0
for i in range(M-N):
res=res+Y[i]
print(res) | N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
X.sort()
Y = []
for i in range(M-1):
Y.append(abs(X[i]-X[i+1]))
Y.sort()
res=0
for i in range(M-N):
res=res+Y[i]
print(res) | p03137 |
import sys
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18
def main():
#n = int(stdin.readline().rstrip())
n,m = list(map(int, stdin.readline().rstrip().split()))
x = list(map(int, stdin.readline().rstrip().split()))
#numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
#word = [stdin.readline().rstrip() for _ in range(n)]
#number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
#zeros = [[0] * w for i in range(h)]
if n>m:
print((0))
exit()
spl = n-1
sa = [0]*(m-1)
x.sort()
for i in range(m-1):
sa[i] = x[i+1] - x[i]
for i in range(spl):
sa.remove(max(sa))
print((sum(sa)))
main()
| import sys
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18
def main():
#n = int(stdin.readline().rstrip())
n,m = list(map(int, stdin.readline().rstrip().split()))
x = list(map(int, stdin.readline().rstrip().split()))
#numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
#word = [stdin.readline().rstrip() for _ in range(n)]
#number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
#zeros = [[0] * w for i in range(h)]
if n>m:
print((0))
exit()
spl = n-1
sa = [0]*(m-1)
x.sort()
for i in range(m-1):
sa[i] = x[i+1] - x[i]
sa.sort()
i = m-n
print((sum(sa[:i])))
main()
| p03137 |
N, M = input().split()
N = int(N)
M = int(M)
X = list(map(int, input().split(" ")))
X = sorted(X)
L = []
for i in range(1,M):
L.append(X[i]-X[i-1])
L = sorted(L)
if N >= M:
print((0))
elif N == 1:
print((sum(L)))
else:
print((sum(L[:-N+1]))) | def main():
N, M = list(map(int, input().split()))
x = sorted(list(map(int, input().split())))
sa = []
for i in range(M-1):
sa.append(x[i+1] - x[i])
sa = sorted(sa, reverse=True)
# print(sa)
if N >= M:
print((0))
else:
print((sum(sa[N-1:])))
if __name__ == "__main__":
main() | p03137 |
N,M=list(map(int,input().split()))
Xs=list(map(int,input().split()))
Xs.sort()
costs=[abs(Xs[i]-Xs[i+1]) for i in range(M-1)]
for i in range(N-1):
if not costs:
print((0))
exit(0)
costs.remove(max(costs))
print((sum(costs))) | N,M=list(map(int,input().split()))
Xs=list(map(int,input().split()))
Xs.sort()
costs=[abs(Xs[i]-Xs[i+1]) for i in range(M-1)]
costs.sort(reverse=True)
for i in range(N-1):
if not costs:
print((0))
exit(0)
costs.pop(0)
print((sum(costs))) | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
L = []
for i in reversed(list(range(len(X)))):
if i - 1 < 0:
break
if (X[i] >= 0 and X[i-1] >= 0) or (X[i] <= 0 and X[i-1] <= 0):
L.append(abs(X[i] - X[i-1]))
else:
L.append(abs(X[i]) + abs(X[i-1]))
L.sort()
L_min = 0
for i in range(M-N):
L_min += L[i]
print(L_min)
| N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
L = [0] * (M-1)
for i in range(M-1):
L[i] = abs(X[i+1] - X[i])
L.sort()
print((sum(L[:-(N-1)]) if N != 1 else sum(L)))
| p03137 |
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
a = []
for i in range(m-1):
a.append(x[i+1]-x[i])
if n >= m:
print((0))
else:
for i in range(n-1):
a.remove(max(a))
print((sum(a))) | n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
x.sort()
a = []
ans = 0
for i in range(m-1):
a.append(x[i+1]-x[i])
a.sort()
if n >= m:
print((0))
else:
for i in range(m-n):
ans += a[i]
print(ans)
| p03137 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return eval(input())
def main():
N, M = LI()
X = LI()
X = sorted(X)
diff = []
for i in range(M-1):
d = X[i+1] - X[i]
diff.append(d)
diff = sorted(diff)
while N - 1> 0 and len(diff) > 0:
diff = diff[:-1]
N -= 1
ans = sum(diff)
print(ans)
'''
X = sorted(X)
min_dist = [0] * M
if N == 1:
return X[-1] - X[0]
print(X)
for i in range(1, M-1):
min_dist[i] = min(abs(X[i] - X[i-1]), abs(X[i+1] - X[i]))
print(min_dist)
min_dist = sorted(min_dist)[::-1]
print(min_dist)
for i in range(N-2):
if len(min_dist) > 0:
min_dist.pop(-1)
print(sum(min_dist))
'''
main()
| import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return eval(input())
def main():
N, M = LI()
X = LI()
X = sorted(X)
diff = []
for i in range(M-1):
d = X[i+1] - X[i]
diff.append(d)
diff = sorted(diff)
while N - 1> 0 and len(diff) > 0:
diff.pop()
N -= 1
ans = sum(diff)
print(ans)
'''
X = sorted(X)
min_dist = [0] * M
if N == 1:
return X[-1] - X[0]
print(X)
for i in range(1, M-1):
min_dist[i] = min(abs(X[i] - X[i-1]), abs(X[i+1] - X[i]))
print(min_dist)
min_dist = sorted(min_dist)[::-1]
print(min_dist)
for i in range(N-2):
if len(min_dist) > 0:
min_dist.pop(-1)
print(sum(min_dist))
'''
main()
| p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
d = [0]*m
for i in range(1,m):
d[i] = x[i]-x[i-1]
for i in range(n-1):
if d == []:
break
else:
d.remove(max(d))
ans = 0
for i in range(len(d)):
ans += d[i]
print(ans) | n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
d = [0]*m
for i in range(1,m):
d[i] = x[i]-x[i-1]
d.sort()
if n < m:
d = d[1:m-n+1]
else:
d = [0]
ans = 0
for i in range(len(d)):
ans += d[i]
print(ans) | p03137 |
N, M = list(map(int,input().split()))
X = [int(x) for x in input().split()]
X.sort(reverse=True)
valX = [X[x] - X[x + 1] for x in range(M - 1)]
if N >= M:
print((0))
exit()
if N == 1:
print((max(X) - min(X)))
exit()
for i in range(1,N):
valX[valX.index(max(valX))] = 0
print((sum(valX))) | N, M = list(map(int,input().split()))
X = [int(x) for x in input().split()]
X.sort(reverse=True)
valX = [X[x] - X[x + 1] for x in range(M - 1)]
valX.sort(reverse=True)
if N >= M:
print((0))
exit()
if N == 1:
print((max(X) - min(X)))
exit()
for i in range(N - 1):
valX[i] = 0
print((sum(valX))) | p03137 |
def main():
n, m = list(map(int, input().split()))
t = list(map(int, input().split()))
if n >= m:
return 0
t.sort()
x = [[t[i], t[i+1] - t[i]] for i in range(m-1)]
x.append([t[m-1], 0])
x.sort(key=lambda a: a[1], reverse=True)
sum_dis = t[m-1] - t[0]
skip_dis = sum([x[i][1] for i in range(n - 1)])
return sum_dis - skip_dis
print((main())) | def main():
N, M = list(map(int, input().split()))
t = [int(i) for i in input().split()]
t.sort()
if N >= M:
return 0
x = [j-i for i, j in zip(t, t[1:])]
x.sort(reverse=True)
return (t[-1] - t[0]) - sum([x[i] for i in range(N - 1)])
print((main()))
| p03137 |
N, M = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
diffx = [x[i+1]-x[i] for i in range(M-1)]
if M == 1:
print((0))
else:
for i in range(N-1):
idx = diffx.index(max(diffx))
diffx[idx] = 0
print((sum(diffx))) | N, M = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
diffx = [x[i+1]-x[i] for i in range(M-1)]
diffx.sort(reverse = True)
if M == 1:
print((0))
else:
tmp = sum(diffx[:(N-1)])
print((x[-1] - x[0] - tmp)) | p03137 |
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
d = [x[i] - x[i-1] for i in range(1, m)]
d.sort()
print((sum(d[:m-n]) if m >= n else 0)) | n,m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.sort()
dis=[x[i+1]-x[i] for i in range(m-1)]
dis.sort()
print((sum(dis[:m-n]) if m>=n else 0)) | p03137 |
N,M=list(map(int,input().split()))
X=sorted([int(i) for i in input().split()])
ans=X[-1]-X[0]
Y=[0 for i in range(M-1)]
for i in range(M-1):
Y[i]=X[i+1]-X[i]
Y.sort(reverse=True)
for i in range(min(N-1,M-1)):
ans-=Y[i]
print(ans)
| N,M=list(map(int,input().split()));X=sorted([int(i) for i in input().split()]);print((sum(sorted([X[i+1]-X[i] for i in range(M-1)],reverse=True)[N-1:M-1]))) | p03137 |
N, M = list(map(int, input().split()))
x = list(map(int, input().split()))
x = list(sorted(x))
y = [x[i] - x[i - 1] for i in range(1, M)]
y = list(sorted(y))
ans = 0
for i in range(M - N):
ans += y[i]
print(ans)
| N, M = list(map(int, input().split()))
x = list(map(int, input().split()))
x = list(sorted(x))
d = [x1 - x0 for x1, x0 in zip(x[1:], x)]
d = list(sorted(d))
ans = 0
for i in range(M - N): # (M - 1) - (N - 1)
ans += d[i]
print(ans)
| p03137 |
N, M = list(map(int, input().split()))
x = list(map(int, input().split()))
x = sorted(x)
y = [xb - xa for xa, xb in zip(x, x[1:])]
y = sorted(y, reverse=True)
print((sum(y) - sum(y[:N - 1])))
| N, M = list(map(int, input().split()))
x = list(map(int, input().split()))
x = list(sorted(x))
y = [xb - xa for xa, xb in zip(x, x[1:])]
y = list(sorted(y, reverse=True))
print((sum(y) - sum(y[:N - 1])))
| p03137 |
N, M = list(map(int, input().split()))
X = sorted(list(map(int, input().split())))
dist = sorted([abs(X[i] - X[i+1]) for i in range(M-1)])
print((sum(dist[:M-N]) if N < M else 0))
| N, M = list(map(int, input().split()))
X = sorted(map(int, input().split()))
dist = sorted([X[i+1] - X[i] for i in range(M-1)])[::-1]
print((sum(dist[N-1:])))
| p03137 |
N,M=list(map(int,input().split()))
X=[int(_) for _ in input().split()]
X.sort()
if N>=M:
print('0')
exit(0)
Sum=[]
for i in range(M-1):
Sum.append(abs(X[i+1]-X[i]))
Sum.sort()
for i in range(N-1):
Sum.remove(Sum[-1])
print((sum(Sum)))
| N,M=list(map(int,input().split()))
X=[int(_) for _ in input().split()]
X.sort()
if N>=M:
print('0')
exit(0)
Sum=[]
for i in range(M-1):
Sum.append(abs(X[i+1]-X[i]))
Sum.sort()
for i in range(N-1):
Sum.pop()
print((sum(Sum)))
| p03137 |
#!usr/bin/env python3
from collections import defaultdict
import math
def LI(): return list(map(int, input().split()))
def II(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007
#A
"""
t,x = LI()
print(t/x)
"""
#B
"""
n= II()
a = LI()
m = max(a)
if m >= sum(a)-m:
print("No")
else:
print("Yes")
"""
#C
n,m = LI()
x = LI()
x.sort()
l = [x[i+1]-x[i] for i in range(m-1)]
l.sort()
l = l[::-1]
for i in range(n-1):
if len(l) == 0:
print((0))
quit()
l.pop(0)
print((sum(l)))
#D
"""
n,k = LI()
a = LI()
l = 0
b = [0 for i in range(n)]
for i in range(n):
b[i] = list(bin(a[i]))[2:]
l = max(l,len(b[i]))
s = [0 for i in range(l)]
for i in range(n):
for j in range(l-len(b[i])):
b[i].insert(0,"0")
for i in range(n):
for j in range(l):
s[j] += 1-int(b[i][j])
ke = 1
for i in range(l)[::-1]:
if s[i] <= n//2:
s[i] = [(n-s[i])*ke,0,float("inf")]
else:
s[i] = [(n-s[i])*ke,s[i]*ke,ke]
ke *= 2
s.sort(key = lambda x:x[0])
d = 0
ans = 0
key = len(list(bin(k)))-2
key -= l
ke = 2**l
print(s)
for i in range(key):
d += ke
ans += n*ke
ke *= 2
for i in range(l):
r,q,p = s[i]
if d+p <= k:
d += p
ans += q
else:
ans += r
print(ans)
"""
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| #!usr/bin/env python3
from collections import defaultdict
import math
def LI(): return list(map(int, input().split()))
def II(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007
#A
"""
t,x = LI()
print(t/x)
"""
#B
"""
n= II()
a = LI()
m = max(a)
if m >= sum(a)-m:
print("No")
else:
print("Yes")
"""
#C
n,m = LI()
x = LI()
x.sort()
l = [x[i+1]-x[i] for i in range(m-1)]
l.sort()
l = l[::-1]
ans = sum(l[max(n-1,0):])
print(ans)
#D
"""
n,k = LI()
a = LI()
l = 0
b = [0 for i in range(n)]
for i in range(n):
b[i] = list(bin(a[i]))[2:]
l = max(l,len(b[i]))
s = [0 for i in range(l)]
for i in range(n):
for j in range(l-len(b[i])):
b[i].insert(0,"0")
for i in range(n):
for j in range(l):
s[j] += 1-int(b[i][j])
ke = 1
for i in range(l)[::-1]:
if s[i] <= n//2:
s[i] = [(n-s[i])*ke,0,float("inf")]
else:
s[i] = [(n-s[i])*ke,s[i]*ke,ke]
ke *= 2
s.sort(key = lambda x:x[0])
d = 0
ans = 0
key = len(list(bin(k)))-2
key -= l
ke = 2**l
print(s)
for i in range(key):
d += ke
ans += n*ke
ke *= 2
for i in range(l):
r,q,p = s[i]
if d+p <= k:
d += p
ans += q
else:
ans += r
print(ans)
"""
#E
#F
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| p03137 |
import sys
import math
# -*- coding: utf-8 -*-
n ,m = list(map(int, input().split()))
a=list(map(int, input().split()))
##まずソート
a.sort()
dist = []
##次のターゲットとの距離を出す
for i in range(m-1):
dist.append((a[i+1]-a[i]))
##最後のターゲットは右隣がないので大きな値
dist.append(1000000)
dist.sort()
score = 0
##隣との距離が小さい順に駒に回らせる
while len(dist) > n :
score += dist[0]
dist = dist[1:]
print(score)
|
import sys
import math
# -*- coding: utf-8 -*-
n ,m = list(map(int, input().split()))
a=list(map(int, input().split()))
##まずソート
a.sort()
dist = [None] * m
##次のターゲットとの距離を出す
for i in range(m-1):
dist[i] = (a[i+1]-a[i])
##最後のターゲットは右隣がないので大きな値
dist[m-1] = 1000000
dist.sort()
score = 0
##隣との距離が小さい順に駒に回らせる
for i in range(m-n):
score += dist[i]
print(score)
| p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
X_subtraction = []
for i in range(len(X)-1):
X_subtraction.append(X[i+1] - X[i])
for _ in range(N-1):
try:
X_subtraction.remove(max(X_subtraction))
except:
break
print((sum(X_subtraction))) | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
X_subtraction = []
for i in range(len(X)-1):
X_subtraction.append(X[i+1] - X[i])
X_subtraction.sort(reverse=True)
del X_subtraction[0:N-1]
print((sum(X_subtraction))) | p03137 |
# coding: utf-8
# Your code here!
a = list(map(int,input().split()))
b = list(map(int,input().split()))
b.sort()
c = []
if len(b) != 1:
for i in range(len(b) - 1):
c.append(b[i+1] - b[i])
if len(b) == 1:
print((0))
else:
for j in range(min(a[0] - 1,a[1])):
for k in range(len(c)):
if c[k] == max(c):
c[k] = 0
break
print((sum(c)))
| # coding: utf-8
# Your code here!
a = list(map(int,input().split()))
b = list(map(int,input().split()))
b.sort()
c = []
if len(b) != 1:
for i in range(len(b) - 1):
c.append(b[i+1] - b[i])
if len(b) == 1:
print((0))
else:
c.sort()
for j in range(min(a[0] - 1,a[1])):
c[len(c)- 1 - j] = 0
print((sum(c)))
| p03137 |
N,M=list(map(int,input().split()))
X=sorted(map(int,input().split()))
d=sorted(j-i for i,j in zip(X,X[1:]))[::-1]
print((sum(d[N-1:]))) | N,M=list(map(int,input().split()))
X=sorted(set(list(map(int,input().split()))))
s=[]
for i in range(M-1):s.append(X[i+1]-X[i])
s=sorted(s)[::-1]
print((sum(s[N-1:]))) | p03137 |
import sys
N, M = list(map(int, input().split()))
X = [int(_) for _ in input().split()]
# 座標数よりコマ数が多ければ初期位置で条件を満たす
if N >= M:
print((0))
sys.exit()
# ソートする
X.sort()
# 隣り合う数の差を計算する
diff = list()
for m in range(M-1):
diff.append(X[m+1] - X[m])
for n in range(N-1):
max_index = diff.index(max(diff))
diff.pop(max_index)
print((sum(diff))) | import sys
N, M = list(map(int, input().split()))
X = [int(_) for _ in input().split()]
# 座標数よりコマ数が多ければ初期位置で条件を満たす
if N >= M:
print((0))
sys.exit()
# ソートする
X.sort()
# 隣り合う数の差を計算する
diff = list()
for m in range(M-1):
diff.append(X[m+1] - X[m])
diff.sort(reverse=True)
print((sum(diff[N-1:]))) | p03137 |
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
dist = [X[i+1] - X[i] for i in range(len(X)-1)]
if N>=M: print((0))
else:
for i in range(N-1):
dist.remove(max(dist))
print((sum(dist))) | N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()
D = [X[i+1] - X[i] for i in range(len(X)-1)]
D.sort()
if N>=M: print((0))
else:
newD = D[:len(D)-(N-1)]
print((sum(newD))) | p03137 |
import sys
koma_num, goal_num = [int(a) for a in input().split(' ')]
if koma_num >= goal_num:
print((0))
sys.exit()
goals = [int(a) for a in input().split(' ')]
goals.sort()
dist_diff = [int(goals[i+1] - goals[i]) for i in range(len(goals)-1)]
for i in range(koma_num-1):
max_dist = max(dist_diff)
dist_diff.remove(max_dist)
print((sum(dist_diff))) | import sys
koma_num, goal_num = [int(a) for a in input().split(' ')]
if koma_num >= goal_num:
print((0))
sys.exit()
goals = [int(a) for a in input().split(' ')]
goals.sort()
dist_diff = [int(goals[i+1] - goals[i]) for i in range(len(goals)-1)]
dist_diff.sort()
ans_num = goal_num - koma_num
print((sum(dist_diff[:ans_num]))) | p03137 |
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
dp=[[0 for i in range(m)]for i in range(m)]
s=[a[i]-a[i-1] if i!=0 else 0 for i in range(1,m) ]
s.sort()
if n!=1:
print((sum(s[:-n+1])))
else:
print((sum(s)))
| n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
s=[a[i]-a[i-1] if i!=0 else 0 for i in range(1,m) ]
s.sort()
if n!=1:
print((sum(s[:-n+1])))
else:
print((sum(s)))
| p03137 |
n, m = list(map(int, input().split()))
k = list(map(int, input().split()))
d = [0]*(m-1)
k.sort()
for i in range(m-1):
d[i] = abs(k[i]-k[i+1])
d = sorted(d, reverse=True)
res = 0
for i in range(n-1):
if i==m-1:
break
res += d[i]
print((sum(d)-res))
| n, m = list(map(int, input().split()))
k = list(map(int, input().split()))
d = [0]*(m-1)
k.sort()
for i in range(m-1):
d[i] = abs(k[i]-k[i+1])
d = sorted(d, reverse=True)
print((sum(d)-sum(d[:n-1])))
| p03137 |
N,M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
#X.sort()
B=[]
if N>=M:
print((0))
else:
for i in range(M-1):
B.append(X[i+1]-X[i])
B.sort()
print((sum(B[:M-N])))
| N,M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
#X.sort()
B=[]
if N>=M:
print((0))
else:
for i in range(M-1):
B.append(X[i+1]-X[i])
B = sorted(B,reverse = True)
print((sum(B[N-1:])))
| p03137 |
N,M = list(map(int,input().split()))
X = list(map(int,input().split()))
if N>=M:
print((0))
else:
X = sorted(X)
A = []
for i in range(1,M):
A.append(X[i]-X[i-1])
A = sorted(A)
print((sum(A[:M-N]))) | N,M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
if N>=M:
print((0))
else:
L = []
for i in range(1,M):
L.append(X[i]-X[i-1])
L = sorted(L,reverse=True)
tot = sum(L[N-1:])
print(tot) | p03137 |
N,M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
if N>=M:
print((0))
else:
L = []
for i in range(1,M):
L.append(X[i]-X[i-1])
L = sorted(L,reverse=True)
tot = sum(L[N-1:])
print(tot) | N,M = list(map(int,input().split()))
X = sorted(list(map(int,input().split())))
L = []
for i in range(1,M):
L.append(X[i]-X[i-1])
L = sorted(L,reverse=True)
if N>=M:
print((0))
else:
print((sum(L[N-1:]))) | p03137 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.