#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
ios_base::sync_with_stdio(0), cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> dziury(n - 1);
int ost;
cin >> ost;
for (int i = 1; i < n; ++i)
{
int akt;
cin >> akt;
dziury[i - 1] = akt - ost - 1;
ost = akt;
}
sort(dziury.begin(), dziury.end());
auto it1 = lower_bound(dziury.begin(), dziury.end(), 0);
auto it2 = upper_bound(dziury.begin(), dziury.end(), 0);
int l0 = it2 - it1, wynik = n;
for (int i = l0; i < n - k; ++i)
wynik += dziury[i];
cout << wynik << '\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... |