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;
typedef long long ll;
typedef pair<ll,ll> pll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<n;i++)
#define F first
#define S second
#define pb push_back
int main()
{
ll n,k;
cin>>n>>k;
vector<ll> a(n),tmp;
rep(i,n) cin>>a[i];
ll tot=a[n-1]+1-a[0];
rep(i,n-1)
{
tmp.pb(a[i+1]-a[i]-1);
}
sort(tmp.begin(),tmp.end(),greater<ll>());
rep(i,k-1) tot-=tmp[i];
cout<<tot;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |