제출 #547471

#제출 시각아이디문제언어결과실행 시간메모리
547471beaconmcStove (JOI18_stove)Pypy 3
0 / 100
34 ms18184 KiB
n,k = map(int, input().split())
sus = []
for i in range(n):
    sus.append(int(input()))
sus.sort()
realsus = []
for i in range(len(sus)-1):
    realsus.append(sus[i+1] - sus[i])
realsus.sort()

ans = k

for i in range(n-k):
    ans += realsus[i]
ans += k
print(ans)
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...