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+5;
ll n,k;
ll val;
ll x[N];
priority_queue <ll> pq;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for(int i=1;i<=n;i++) cin >> x[i];
sort(x+1,x+1+n);
for(int i=1;i<n;i++){
pq.push(x[i+1] - (x[i]+1));
}
val = (x[n] - x[1]) + 1;
for(int i=1;i<=k-1;i++){
val -= pq.top();
pq.pop();
}
cout << val;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |