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;
int n, k;
vector<int> v;
void read() {
cin >> n >> k;
v.resize(n);
for (auto &a : v) cin >> a;
}
void solve() {
int ans = v.back() - v.front() + 1;
vector<int> dist(n - 1);
for (int i = 0; i < n - 1; ++i) {
dist[i] = v[i + 1] - v[i] - 1;
}
sort(begin(dist), end(dist), greater<>());
for (int i = 0; i < k - 1; ++i) {
ans -= dist[i];
}
cout << ans << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
read();
solve();
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... |