#include <bits/stdc++.h>
#include <random>
using namespace std;
using ll = long long;
using ld = long double;
ll INF = 1e18 + 10;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll n, k;
cin >> n >> k;
k--;
vector<ll> s(n);
ll def = n;
for (ll i = 0; i < n; i++) {
cin >> s[i];
}
vector<ll> mx;
for (ll i = 0; i < n - 1; i++) {
mx.push_back(s[i + 1] - s[i] - 1);
}
sort(mx.rbegin(), mx.rend());
for (ll i = k; i < mx.size(); i++) {
def += mx[i];
}
cout << def;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |