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;
const int N = 100005;
int n, k, a[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
if(n == 1) return cout << 1 << endl, 0;
for(int i = 0; i < n; ++i) {
cin >> a[i];
if(i) a[i - 1] = a[i] - a[i - 1];
}
sort(a, a + n - 1);
long long fp = n;
for(int i = 0; i < n - k; ++i) {
fp += a[i];
}
cout << fp << endl;
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... |