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;
int a[100050];
int b[100050];
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
int n,k;
cin>>n>>k;
for(int i=0;i<n;i++) cin>>a[i];
int x=a[n-1]-a[0]+1;
for(int i=0;i<n-1;i++) b[i]=a[i+1]-(a[i]+1);
sort(b,b+n-1);
for(int i=n-2;i>=n-k;i--) x-=b[i];
cout<<x;
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... |