#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,k,total;
vector<int> gap;
vector<pair<int,int>> v;
int32_t main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> k;
for(int i=0;i<n;i++){
int a;cin >> a;
v.push_back({a,a+1});
}
total = v[n-1].first - v[0].first + 1;
for(int i=1;i<n;i++){
gap.push_back(v[i].first - v[i-1].second);
}
sort(gap.begin(),gap.end(),greater<int>());
for(int i=0;i<k-1;i++){
total -= gap[i];
}
cout << total << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |