Submission #67534974

Source Code Expand

import sys, os, io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

n, m = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
u = [0] * (n - 1)
for i in range(n - 1):
    u[i] = x[i + 1] - x[i]
u.sort(reverse = True)
ans = x[-1] - x[0]
for i in range(m - 1):
    ans -= u[i]
print(ans)

Submission Info

Submission Time
Task D - Transmission Mission
User misorin
Language Python (PyPy 3.10-v7.3.12)
Score 400
Code Size 331 Byte
Status AC
Exec Time 261 ms
Memory 179132 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 18
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 54 ms 76308 KiB
00-sample-02.txt AC 54 ms 76736 KiB
00-sample-03.txt AC 54 ms 76252 KiB
01-01.txt AC 55 ms 76328 KiB
01-02.txt AC 54 ms 76272 KiB
01-03.txt AC 54 ms 76452 KiB
01-04.txt AC 54 ms 76524 KiB
01-05.txt AC 54 ms 76748 KiB
01-06.txt AC 54 ms 76368 KiB
01-07.txt AC 132 ms 163292 KiB
01-08.txt AC 132 ms 163244 KiB
01-09.txt AC 212 ms 179132 KiB
01-10.txt AC 169 ms 159076 KiB
01-11.txt AC 228 ms 163536 KiB
01-12.txt AC 157 ms 141208 KiB
01-13.txt AC 261 ms 163336 KiB
01-14.txt AC 173 ms 149936 KiB
01-15.txt AC 176 ms 163292 KiB