| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 472937 | dron_rp | Stove (JOI18_stove) | C++14 | 23 ms | 2076 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;
using ll = long long;
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i<n; i++){
cin >> a[i];
}
vector<int> gapSize(n-1);
for (int i = 0; i<n-1; i++){
gapSize[i] = a[i+1]-a[i]-1;
}
sort(gapSize.rbegin(), gapSize.rend());
int ans = a[n-1]+1 - a[0];
for (int i = 0; i<k-1; i++){
ans -= gapSize[i];
}
cout << ans << "\n";
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
