Submission #871002

#TimeUsernameProblemLanguageResultExecution timeMemory
871002FarizAbduhakimovStove (JOI18_stove)Cpython 3
100 / 100
158 ms8940 KiB
n,k=map(int,input().split()) l=[] for i in range(n): a=int(input()) l.append(a) for i in range(len(l)-1): l[i]=l[i+1]-l[i]-1 s=n l=sorted(l) for i in range(n-k): s+=l[i] print(s)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...