# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
330786 | M_W | Stove (JOI18_stove) | C++14 | 27 ms | 2048 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;
int g[100100], d[100100];
int main(){
int N, K;
scanf("%d %d", &N, &K);
for(int i = 0; i < N; i++)
scanf("%d", &g[i]);
for(int i = 0; i < N - 1; i++)
d[i] = g[i + 1] - g[i] - 1;
sort(d, d + N - 1, greater<int>());
int ans = g[N - 1] - g[0] + 1;
for(int i = 0; i < K - 1; i++){
ans -= d[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... |