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;
long long int a[100000];
vector<long long int> vec;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int t=1,n,k,gaps,ans;
//cin >> t;
while (t--){
cin >> n >> k;
for (int i = 0; i < n; i++){
cin >> a[i];
}
for (int i = 1; i < n; i++){
vec.push_back(a[i]-a[i-1]);
}
sort(vec.begin(),vec.end());
gaps = n-k;
ans = 0;
for (int i = 0; i < gaps; i++){
ans += vec[i];
}
ans += n;
ans -= gaps;
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... |