#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, k, a[100005];
vector <int> range;
signed main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
sort(a + 1, a + n + 1);
int needed = a[n] - a[1] + 1;
for (int i = 2; i <= n; i++)
{
range.push_back(a[i] - a[i - 1] - 1);
}
sort(range.begin(), range.end(), greater<int>());
int sum = 0;
for (int i = 0; i < k - 1; i++)
{
sum += range[i];
}
cout << needed - sum;
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... |