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 n,k,a[100005],b[100005],ans;
int main()
{
cin>>n>>k>>a[0];
for(int i=1;i<n;i++)
{
cin>>a[i];
b[i]=a[i]-a[i-1];
}
sort(b+1,b+n);
for(int i=1;i<=n-k;i++)
ans+=b[i]-1;
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... |