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
using namespace std;
const int N = 1e5+9;
ll arr[N];
int main(){
cin.tie(0)->sync_with_stdio(false);
int n,k;
cin>>n>>k;
for(int i=1;i<=n;i++){
cin>>arr[i];
}
priority_queue<ll> pq;
sort(arr+1,arr+n+1);
ll all = arr[n]+1 - arr[1];
for(int i=1;i<=n;i++) {
//cout<<arr[i]-arr[i-1]-1<<" ";
pq.push(arr[i]-arr[i-1]-1);
}
for(int i=1;i<=k-1;i++){
all-=pq.top();
pq.pop();
}
cout<<all;
return 0;
}
/*
3 1
1
3
6
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |