Submission #1049740

#	Time	Username	Problem	Language	Result	Execution time	Memory
1049740		vjudge1	Stove (JOI18_stove)	Cpython 3	100 / 100	194 ms	23596 KiB

stove

n,k=map(int,input().split())
mas=[]
dif=[]
for i in range(n):
    mas.append(int(input()))
    if len(mas)>=2:
        dif.append([mas[-1]-mas[-2],i])
dif.sort(key=lambda x:x[0],reverse=True)
if n==k:
    print(n)
elif k==1:
    print(mas[-1]+1-mas[0])
else:
    c=0
    ind=[0]
    for i in range(k-1):
        ind.append(dif[i][1])
    ind.append(n)
    ind.sort()
    for i in range(1,len(ind)):

        c+=mas[ind[i]-1]+1-mas[ind[i-1]]
    print(c)

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