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 = 1e5;
int n,k;
int t[N+5];
int a[N+5];
int main(){
cin >> n >> k;
cin >> t[0];
for(int i = 1; i < n; i++){
cin >> t[i];
a[i] = t[i]-t[i-1];
}
sort(a+1,a+n);
long long tong = 0;
for(int i = 1; i <= n - k; i++){
// cout << a[i] << " ";
tong += a[i];
}
// cout << endl;
tong += k;
cout << tong;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |