제출 #416792

#제출 시각아이디문제언어결과실행 시간메모리
416792minzoaStove (JOI18_stove)Cpython 3
100 / 100
287 ms12024 KiB
n,k=map(int, input().split()) l=[] for i in range(n): l.append(int(input())) d=[] for i in range(1,n): d.append(l[i]-l[i-1]) d=sorted(d) ans=0 for i in range(n-k): ans+=d[i]-1 print(ans+n)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...