제출 #1235479

#제출 시각아이디문제언어결과실행 시간메모리
1235479stefdascaStove (JOI18_stove)Pypy 3
100 / 100
196 ms56408 KiB
n, k = map(int, input().split()) times = [] while len(times) < n: times.extend(map(int, input().split())) diffs = [times[i] - times[i-1] for i in range(1, n)] diffs.sort() ans = n count = max(n - k, 0) for diff in diffs[:count]: ans += diff - 1 print(ans)

컴파일 시 표준 출력 (stdout) 메시지

Compiling 'stove.py'...

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

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