Submission #67548911

Source Code Expand

def solve(n, m, x):
    if m >= n:
        print(0)
        return
    x.sort()

    pd = [x[i+1] - x[i] for i in range(n - 1)]
    pd.sort(reverse=True)

    res = (x[-1] - x[0]) - sum(pd[:m - 1])

    print(res)


n, m = map(int, input().split())
x = list(map(int, input().split()))
solve(n, m, x)

Submission Info

Submission Time
Task D - Transmission Mission
User regomal
Language Python (PyPy 3.10-v7.3.12)
Score 400
Code Size 317 Byte
Status AC
Exec Time 272 ms
Memory 177912 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 63 ms 76536 KiB
00-sample-02.txt AC 66 ms 76496 KiB
00-sample-03.txt AC 66 ms 76800 KiB
01-01.txt AC 66 ms 76672 KiB
01-02.txt AC 65 ms 76660 KiB
01-03.txt AC 65 ms 76544 KiB
01-04.txt AC 63 ms 76640 KiB
01-05.txt AC 63 ms 76380 KiB
01-06.txt AC 62 ms 76548 KiB
01-07.txt AC 149 ms 167612 KiB
01-08.txt AC 141 ms 167736 KiB
01-09.txt AC 234 ms 173320 KiB
01-10.txt AC 194 ms 143812 KiB
01-11.txt AC 247 ms 177912 KiB
01-12.txt AC 171 ms 122892 KiB
01-13.txt AC 272 ms 176612 KiB
01-14.txt AC 195 ms 133952 KiB
01-15.txt AC 191 ms 177108 KiB