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;
void solve(){
ll n,k;
cin>>n>>k;
vector<ll> v(n),arr;
for(ll i=0;i<n;i++) cin>>v[i];
ll tot = v[n-1] - v[0] + 1;
for(ll i=1;i<n;i++) arr.push_back(v[i] - v[i-1] - 1);
sort(arr.begin(),arr.end(),greater<ll>());
for(ll i=0;i<(k-1);i++) tot -= arr[i];
cout<<tot<<endl;
}
int main()
{
solve();
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... |