# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1235476 | stefdasca | Stove (JOI18_stove) | Pypy 3 | 163 ms | 65992 KiB |
import sys
data = sys.stdin.read().split()
n, k = map(int, data[:2])
t = list(map(int, data[2:2+n]))
# compute differences between consecutive times
diffs = [t[i] - t[i-1] for i in range(1, n)]
diffs.sort()
# initial answer is the number of intervals (n)
ans = n
# we can place k "breaks", so consider n-k smallest gaps
limit = n - k
for i in range(limit):
ans += diffs[i] - 1
print(ans)
Compilation message (stdout)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |