# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
711412 | thimote75 | Stove (JOI18_stove) | C++14 | 49 ms | 2324 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 num long long
int main () {
int nbNodes, nbVal;
cin >> nbNodes >> nbVal;
nbVal --;
vector<num> deltas;
int last = 0;
for (int i = 0; i < nbNodes; i ++) {
int curr; cin >> curr;
if (last != 0) deltas.push_back(curr - last - 1);
last = curr;
}
sort(deltas.rbegin(), deltas.rend());
num answer = 0;
for (int i = nbVal; i < deltas.size(); i ++)
answer += deltas[i];
cout << (answer + nbNodes);
}
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... |