| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 416792 | minzoa | Stove (JOI18_stove) | Cpython 3 | 287 ms | 12024 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())
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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
