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>
#define pii pair<int, int>
#define f first
#define s second
using namespace std;
int n, k, a[100001], ans;
vector<int> v;
int main(){
cin >> n >> k;
for (int i=1; i<=n; i++){
cin >> a[i];
if (i>1) v.push_back(a[i]-a[i-1]-1);
}
sort(v.begin(), v.end());
ans=n;
for (int i=0; i<n-k; i++) ans+=v[i];
cout << ans << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |