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 <iostream>
#include <algorithm>
using namespace std;
const int nmax=100005;
int t[nmax],skip[nmax];
int n,k,i,ans;
int main()
{
ios_base::sync_with_stdio(false);
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>t[i];
}
ans=t[n]-t[1]+1;
for(i=1;i<n;i++)
{
skip[i]=t[i+1]-t[i]-1;
}
sort(skip+1,skip+n);
for(i=n-1;i>=n-k+1;i--)
ans-=skip[i];
cout<<ans;
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... |