Submission #547477

#	Time	Username	Problem	Language	Result	Execution time	Memory
547477		beaconmc	Stove (JOI18_stove)	Pypy 3	100 / 100	216 ms	29460 KiB

stove

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

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