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;
#define FOR(i,o,e) for(int i=o;i<e;i++)
int main()
{
int n,k;
cin>>n>>k;
int t[n];
FOR(i,0,n)
{
cin>>t[i];
}
int df[n-1];
FOR(i,0,n-1)
{
df[i]=t[i+1]-t[i];
}
sort(df,df+(n-1));
long long int s=0;
FOR(i,0,n-k)
{
s+=df[i];
}
s+=k;
cout<<s<<endl;
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... |