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;
int main(){
cin.tie(0);
cin.sync_with_stdio(0);
int N, K;
int ans = 0;
cin >> N >> K;
vector<int> v(N);
for(auto &i : v) cin >> i;
sort(v.begin(), v.end());
ans = v.back() - v.front() + 1;
priority_queue<int> diff;
for(int i=1; i<N; i++) diff.push(v[i]-v[i-1]-1);
while(--K && !diff.empty())
ans -= diff.top(), diff.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... |