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>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for(int i = x; i < y; i++)
typedef long long ll;
using namespace std;
ll diffs[100000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
ll mx, mn, curr;
cin >> mn;
curr = mn;
FOR(i, 0, n - 1) {
cin >> mx;
diffs[i] = mx - curr - 1;
curr = mx;
}
sort(diffs, diffs + n - 1, greater<ll>());
ll ans = mx - mn + 1;
FOR(i, 0, k - 1) ans -= diffs[i];
cout << ans << '\n';
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... |