#include <bits/stdc++.h>
using namespace std;
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define lo long long
#define fi first
#define se second
lo n,k;
lo guests[100005];
vector<lo> diff;
int main()
{
fio();
cin >> n >> k;
for(int i=1; i<=n; i++){
cin >> guests[i];
if(i>=2){
diff.push_back(guests[i]- guests[i-1] -1);
}
}
sort(diff.rbegin(), diff.rend());
lo ans = guests[n] - guests[1] +1;
for(int i=0; i<k-1; i++){
ans -= diff[i];
}
cout << ans;
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... |