# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
718467 | shoryu386 | Stove (JOI18_stove) | C++17 | 56 ms | 2800 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 int long long
main(){
int n, k; cin >> n >> k; int arr[n];
for (int x= 0; x < n; x++) cin >> arr[x];
sort(arr, arr+n);
int ans = arr[n-1] - arr[0] + 1;
vector<int> diffs;
for (int x = 1; x < n; x++){
diffs.push_back(arr[x] - arr[x-1] - 1);
}
sort(diffs.begin(), diffs.end());
int cnt = 1;
for (int x = diffs.size()-1; x > -1; x--){
if (cnt == k) break;
cnt++;
ans -= diffs[x];
if (cnt == k) break;
}
cout << ans;
}
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... |