This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define X first
#define Y second
int n;int k;
int ar[500005];
signed main(){
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>ar[i];
}
int ans=n;
priority_queue<int,vector<int>,greater<int>>pq;
for(int i=2;i<=n;i++){
pq.push(ar[i]-ar[i-1]-1);
}
for(int i=1;i<=n-k;i++){
ans+=pq.top();
pq.pop();
}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... |