# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
153341 | mhy908 | Stove (JOI18_stove) | C++14 | 27 ms | 2172 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], arr[100010], ans;
int main()
{
scanf("%d %d", &n, &k);
for(int i=1; i<=n; i++)scanf("%d", &t[i]);
for(int i=2; i<=n; i++)arr[i-1]=t[i]-t[i-1]-1;
std::sort(arr+1, arr+n);
ans=t[n]-t[1]+1;
for(int i=n-1; i>=n-k+1; i--)ans-=arr[i];
printf("%d", ans);
}
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... |