| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1092147 | Flandre | Stove (JOI18_stove) | C++17 | 39 ms | 2140 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;
#define ui unsigned int
int main() {
int N, K; // K is matches
cin >> N >> K;
ui wastes[N - 1];
ui t[N];
cin >> t[0];
for (int i = 1; i < N; i++) {
cin >> t[i];
wastes[i-1] = t[i] - t[i-1] - 1;
}
sort(wastes, wastes+N-1);
ui totalwaste = 0;
for (int i = 0; i < N - K; i++) {
totalwaste += wastes[i];
}
cout << N + totalwaste << endl;
return 0;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
