# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
736342 | oyber | Stove (JOI18_stove) | C++14 | 24 ms | 1884 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 <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int n, k;
scanf("%d %d", &n, &k);
vector<int> diffs;
int before = 0;
int first = 0;
for (int i = 0; i < n; i++) {
int t;
scanf("%d", &t);
if (i != 0) {
int diff = t-before-1;
diffs.push_back(-diff);
} else {
first = t;
}
before = t;
}
sort(diffs.begin(), diffs.end());
int wait = before-first+1;
for (int i = 0; i < k-1; i++) {
wait += diffs[i];
}
printf("%d\n", wait);
}
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... |