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 <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define fastIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main(){
fastIO;
int n, k;
cin >> n >> k;
k--;
int a[n];
for(int i=0; i<n; i++) cin >> a[i];
int ans = a[n-1] - a[0] + 1;
vector<int> gaps;
for(int i=1; i<n; i++){
gaps.push_back(a[i] - a[i-1] - 1);
}
sort(gaps.begin(), gaps.end());
int sz = gaps.size()-1;
for(int i=sz; k>0 && i>=0; i--, k--){
ans -= gaps[i];
}
cout << ans << '\n';
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |