| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 206255 | hhh07 | Stove (JOI18_stove) | C++14 | 76 ms | 3056 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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
int n, k;
cin >> n >> k;
long long t[n];
vector<long long> r;
long long res = 0;
for (int i = 0; i < n; i++){
cin >> t[i];
if (i > 0)
r.push_back(t[i] - t[i - 1]);
}
sort(r.begin(), r.end());
for (int i = 0 ; i < n - k; i++){
res += r[i];
}
cout << res + k << 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... | ||||
