Submission #4166966

Source Code Expand

N,M=map(int,input().split())
X=list(map(int,input().split()))
if(len(X)<=N):
  print(0)
else:
  #print(N,M,X)
  sort_X=sorted(X)
  #print(sort_X)
  #print(sort_X[1:],sort_X[0:len(sort_X)-1])
  X_sa=[x - y for (x, y) in zip(sort_X[1:], sort_X[0:len(X)-1])]
  #print(X_sa)
  sort_X_sa=sorted(X_sa)
  #print(sort_X_sa)
  #print(sort_X_sa[:M-N])
  print(sum(sort_X_sa[:M-N]))

Submission Info

Submission Time
Task C - Streamline
User tayutaedomoshizu
Language Python (3.4.3)
Score 300
Code Size 385 Byte
Status AC
Exec Time 98 ms
Memory 13968 KiB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 23
AC × 3
Set Name Test Cases
All 0_normal_1, 0_normal_2, 0_normal_3, 0_normal_4, 1_max_1, 1_max_2, 1_max_3, 1_max_4, 2_nsmall_1, 2_nsmall_2, 2_nsmall_3, 2_nsmall_4, 3_msmall_1, 3_msmall_2, 3_msmall_3, 3_msmall_4, 4_corner_1, 4_corner_2, 4_corner_3, 4_corner_4, sample_01, sample_02, sample_03
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
0_normal_1 AC 17 ms 3060 KiB
0_normal_2 AC 17 ms 3060 KiB
0_normal_3 AC 29 ms 8508 KiB
0_normal_4 AC 85 ms 12228 KiB
1_max_1 AC 30 ms 9372 KiB
1_max_2 AC 28 ms 8172 KiB
1_max_3 AC 40 ms 13960 KiB
1_max_4 AC 98 ms 13968 KiB
2_nsmall_1 AC 92 ms 12880 KiB
2_nsmall_2 AC 25 ms 4468 KiB
2_nsmall_3 AC 81 ms 11576 KiB
2_nsmall_4 AC 36 ms 5424 KiB
3_msmall_1 AC 17 ms 3060 KiB
3_msmall_2 AC 17 ms 3060 KiB
3_msmall_3 AC 17 ms 2940 KiB
3_msmall_4 AC 16 ms 3060 KiB
4_corner_1 AC 23 ms 4084 KiB
4_corner_2 AC 69 ms 11068 KiB
4_corner_3 AC 17 ms 3060 KiB
4_corner_4 AC 17 ms 2940 KiB
sample_01 AC 17 ms 3060 KiB
sample_02 AC 17 ms 2940 KiB
sample_03 AC 17 ms 2940 KiB