Submission #542777

#	Time	Username	Problem	Language	Result	Execution time	Memory
542777		QuantumK9	Stove (JOI18_stove)	Cpython 3	100 / 100	219 ms	12248 KiB

stove

n, k = [ int(x) for x in input().split() ]

a = []

for i in range(n):
    a.append( int(input()) )

a.sort()

t = a[n-1]+1-a[0]

#print(t)

diff = []
for i in range(0,n-1):
    diff.append( a[i+1] - (a[i]+1) )

diff.sort()
diff.reverse()

#print( diff )

for i in range( min( n-1, k-1 ) ):
    t -= diff[i]

print( t )

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