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;
#define ll long long
#define ff first
#define ss second
#define N 100005
int a[N];
priority_queue<int> pq;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin>>n>>k;
int res = n;
for(int i = 1; i <= n; i++){
cin>>a[i];
}
for(int i = 2; i <= n; i++){
pq.push( - (a[i] - a[i - 1] - 1));
}
k = n - k;
while(!pq.empty() && k){
res -= pq.top();
pq.pop();
--k;
}
cout<<res;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |