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>
#define forin(i,a,b) for(int i=a;i<=b;i++)
#define forde(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
using ll = long long;
const int N=1e5+10;
int a[N];
int tgc[N];
int n,k;
int main()
{
cin>>n>>k;
forin(i,1,n) cin>>a[i];
forin(i,2,n)
{
tgc[i-1]=a[i]-(a[i-1]+1);
}
sort(tgc+1,tgc+n);
//forin(i,1,n) cout<<tgc[i]<<" ";
ll res=0;
forin(i,1,n-k)
{
res+=tgc[i];
}
//cout<<res;
cout<<res+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... |