Submission #547476

#	Time	Username	Problem	Language	Result	Execution time	Memory
547476		beaconmc	Stove (JOI18_stove)	Pypy 3	100 / 100	244 ms	27112 KiB

stove

H=input
G=int
E=range
C,F=map(G,H().split())
A=[]
for B in E(C):A.append(G(H()))
D=A[-1]-A[0]+1
A.sort()
I=[]
for B in E(C-1):A[B]=A[B+1]-A[B]-1
del A[-1]
A.sort()
for B in E(F-1):D-=A[-B-1]
print(D)

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