Submission #67534930

Source Code Expand

import sys
import math
import collections
import random
from heapq import heappush, heappop
input = sys.stdin.readline
 
ints = lambda: list(map(int, input().split()))

n, m = ints()
a = ints()
a.sort()
d = []
a.append(0)
for i in range(n - 1):
    d.append(a[i] - a[i + 1])
#print(a)
d.sort()

ans = a[n - 1] - a[0]
ans += sum(d[:m - 1])
print(ans)

Submission Info

Submission Time
Task D - Transmission Mission
User asiad
Language Python (PyPy 3.10-v7.3.12)
Score 400
Code Size 372 Byte
Status AC
Exec Time 299 ms
Memory 220896 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 85 ms 83872 KiB
00-sample-02.txt AC 86 ms 83676 KiB
00-sample-03.txt AC 85 ms 83524 KiB
01-01.txt AC 85 ms 83784 KiB
01-02.txt AC 86 ms 83676 KiB
01-03.txt AC 85 ms 83740 KiB
01-04.txt AC 85 ms 83644 KiB
01-05.txt AC 86 ms 83864 KiB
01-06.txt AC 86 ms 83428 KiB
01-07.txt AC 167 ms 209804 KiB
01-08.txt AC 169 ms 210060 KiB
01-09.txt AC 259 ms 210212 KiB
01-10.txt AC 213 ms 172296 KiB
01-11.txt AC 264 ms 220896 KiB
01-12.txt AC 200 ms 150996 KiB
01-13.txt AC 299 ms 217784 KiB
01-14.txt AC 217 ms 160384 KiB
01-15.txt AC 208 ms 217072 KiB