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],r;
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
cin >> n >> k;
for(int i=0; i<n; i++)cin>>a[i];
r=a[n-1]-a[0]+1;
adjacent_difference(a,a+n,a);
sort(a+1,a+n, greater<int>());
for(int i=1; i < k; i++) r -= (a[i] - 1);
cout << r << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |