Submission #789803

#	Time	Username	Problem	Language	Result	Execution time	Memory
789803		vedantmishra69	Stove (JOI18_stove)	Pypy 3	100 / 100	78 ms	24396 KiB

stove

from bisect import bisect_left, bisect_right
from heapq import heappush, heappop, heapify
from math import *
from collections import defaultdict, Counter, deque
from sys import stdin, stdout
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
ninput = lambda: int(input())
sinput = lambda: input().decode().strip() 
ainput = lambda: list(map(int, input().split()))
printt = lambda *x: stdout.write(" ".join(map(str, x)) + '\n')
ceil = lambda a, b: a // b if (a >= 0) ^ (b > 0) else (abs(a) + abs(b) - 1) // abs(b)

t = 1
for _ in range(t):
    n, k = ainput()
    t = [ninput() for _ in range(n)]
    diff = [t[i] - t[i-1] for i in range(1, n)]
    diff.sort()
    summ = 0
    while k - 1: summ += (diff.pop() - 1); k -= 1
    printt((t[-1] - t[0] + 1) - summ)

• Subtask 1: 20 / 20
• Subtask 2: 30 / 30
• Subtask 3: 50 / 50