Submission #4202089

Source Code Expand

n, m = 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()

sum =0
for i in range(0,len(diff)-n+1) :
    sum += diff[i]

print (sum)

Submission Info

Submission Time
Task C - Streamline
User Cummin
Language Python (3.4.3)
Score 300
Code Size 237 Byte
Status AC
Exec Time 118 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 66 ms 8508 KiB
0_normal_4 AC 105 ms 12132 KiB
1_max_1 AC 69 ms 8936 KiB
1_max_2 AC 63 ms 7920 KiB
1_max_3 AC 112 ms 13964 KiB
1_max_4 AC 118 ms 13968 KiB
2_nsmall_1 AC 116 ms 12876 KiB
2_nsmall_2 AC 28 ms 4084 KiB
2_nsmall_3 AC 106 ms 11576 KiB
2_nsmall_4 AC 42 ms 5424 KiB
3_msmall_1 AC 17 ms 3060 KiB
3_msmall_2 AC 17 ms 2940 KiB
3_msmall_3 AC 18 ms 3060 KiB
3_msmall_4 AC 17 ms 3064 KiB
4_corner_1 AC 26 ms 4084 KiB
4_corner_2 AC 89 ms 10692 KiB
4_corner_3 AC 17 ms 3064 KiB
4_corner_4 AC 17 ms 3060 KiB
sample_01 AC 17 ms 2940 KiB
sample_02 AC 17 ms 3060 KiB
sample_03 AC 17 ms 3060 KiB