# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48442 | arman_ferdous | Stove (JOI18_stove) | C++17 | 32 ms | 11172 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>
using namespace std;
const int N = 1e5+10;
long long arr[N], dif[N];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for(int i = 0; i < n; i++)
scanf("%lld", &arr[i]);
for(int i = 0; i+1 < n; i++)
dif[i] = arr[i+1] - arr[i] - 1;
sort(dif,dif+n-1,greater<int>());
long long ans = arr[n-1] - arr[0] + 1;
for(int i = 1; i < k; i++)
ans -= dif[i-1];
printf("%lld", ans);
return 0;
}
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... |