| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 547472 | beaconmc | Stove (JOI18_stove) | Pypy 3 | 222 ms | 29760 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
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 = 0
for i in range(n-k):
ans += realsus[i]
ans += k
print(ans)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
