Submission #1235476

#TimeUsernameProblemLanguageResultExecution timeMemory
1235476stefdascaStove (JOI18_stove)Pypy 3
100 / 100
163 ms65992 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)

Compiling 'stove.py'...

=======
  adding: __main__.pyc (deflated 28%)

=======
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...