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 v[100003], dif[100003];
int main()
{
int n, k;
cin>>n>>k;
cin>>v[1];
for(int i=2; i<=n; i++)
{
cin>>v[i];
dif[i-1]=v[i]-v[i-1]-1;
}
sort(dif+1, dif+n);
long long sum=v[n]-v[1]+1;
for(int i=n-1; i>=n-k+1; i--)
{
sum-=dif[i];
}
cout<<sum;
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... |