# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163424 | iefnah06 | Stove (JOI18_stove) | C++11 | 58 ms | 2420 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 MAXN = 3e5;
int N, K;
int T[MAXN];
int main() {
scanf("%d %d", &N, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &T[i]);
}
vector<int> gaps;
for (int i = 0; i < N - 1; i++) {
gaps.push_back(T[i + 1] - T[i] - 1);
}
nth_element(gaps.begin(), gaps.begin() + K - 1, gaps.end(), greater<int>());
int ans = T[N - 1] - T[0] + 1;
for (int i = 0; i < K - 1; i++) {
ans -= gaps[i];
}
printf("%d\n", 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... |