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;
int T[100010];
int d[100010];
int ans=0;
int main(){
cin>>n>>k;
for(int i=1;i<=n;i++)
{
cin>>T[i];
}
for(int i=2;i<=n;i++)
{
d[i-1]=T[i]-T[i-1];
}
sort(d+1,d+n);
for(int i=1;i<=n-k;i++)
{
ans+=d[i];
}
ans+=k;
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |