# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153343 | mhy908 | Stove (JOI18_stove) | C++14 | 28 ms | 2040 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.
#include <bits/stdc++.h>
int n,k,t[100010],a[100010],s,i;
int main()
{
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)scanf("%d",&t[i]);
for(i=2;i<=n;i++)a[i-1]=t[i]-t[i-1]-1;
std::sort(a+1,a+n);
for(i=1;i<=n-k;i++)s+=a[i];
printf("%d",s+n);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |