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 ll long long
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
int n, k;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>k;
priority_queue<int, vector<int>, greater<int>> pq;
int last;
cin>>last;
for(int i=1;i<n;i++) {
int cur;
cin>>cur;
pq.push(cur-last-1);
last = cur;
}
int ans = n;
for(int i=0;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... |