Submission #4160623

Source Code Expand

N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
X.sort()

if N==1:
    print(X[-1] - X[0])
else:
    D = [X[i+1]-X[i] for i in range(len(X)-1)]
    #print(D)
    D.sort()
    print(sum(D[:-(N-1)]))

Submission Info

Submission Time
Task C - Streamline
User jaguar29
Language Python (3.4.3)
Score 300
Code Size 234 Byte
Status AC
Exec Time 110 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 18 ms 2940 KiB
0_normal_2 AC 18 ms 3060 KiB
0_normal_3 AC 64 ms 8512 KiB
0_normal_4 AC 97 ms 12228 KiB
1_max_1 AC 69 ms 8932 KiB
1_max_2 AC 61 ms 7920 KiB
1_max_3 AC 110 ms 13968 KiB
1_max_4 AC 108 ms 13960 KiB
2_nsmall_1 AC 76 ms 12240 KiB
2_nsmall_2 AC 23 ms 4084 KiB
2_nsmall_3 AC 100 ms 11532 KiB
2_nsmall_4 AC 47 ms 5428 KiB
3_msmall_1 AC 18 ms 3060 KiB
3_msmall_2 AC 18 ms 3060 KiB
3_msmall_3 AC 18 ms 3060 KiB
3_msmall_4 AC 18 ms 3060 KiB
4_corner_1 AC 25 ms 4084 KiB
4_corner_2 AC 77 ms 10692 KiB
4_corner_3 AC 18 ms 2940 KiB
4_corner_4 AC 18 ms 2940 KiB
sample_01 AC 18 ms 3060 KiB
sample_02 AC 18 ms 3060 KiB
sample_03 AC 18 ms 2940 KiB