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 all(v) ((v).begin(),(v).end())
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll mxN = 2e6 + 1;
ll a[mxN];
priority_queue<ll,vector<ll>,greater<ll>>q;
signed main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
ll n,k;
cin >>n>>k;
cin >>a[0];
for(ll i =1;i < n;i++){
cin >>a[i];
q.push(a[i] - a[i - 1]);
}
ll ans = n;
k = n - k;
while(k > 0){
ans += q.top();
ans--;
q.pop();
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... |