# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1267590 | kutomei3 | Stove (JOI18_stove) | C++20 | 0 ms | 320 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
int n, k;
scanf("%lld %lld", &n, &k);
vector<int> vec(n);
for (int i = 0; i < n; i++) {
scanf("%lld", &vec[i]);
}
priority_queue<pair<int, int>> pq;
for (int i = 0; i < n - 1; i++) {
pq.push({vec[i + 1] - vec[i], i});
}
vector<int> sts(n, 1);
for (int i = 0; i < k - 1; i++) {
sts[pq.top().second] = 0;
pq.pop();
}
int l = vec[0];
int sum = 0;
for (int i = 0; i < n - 1; i++) {
if (!sts[i]) {
sum += vec[i] - l + 1;
l = vec[i + 1];
}
}
printf("%lld", sum + (sts[n - 1] ? 1 : 0));
// cout << '\n';
// for (auto& p : sts) cout << p << ' ';
return 0;
}
/*
1 3 6
2 3
*/
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... |