This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#define MAX 100000
using namespace std;
///ifstream cin ("c.in");
///ofstream cout ("c.out");
int v[MAX + 10], gap[MAX + 10];
void speedy()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int main()
{
speedy();
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int i = 1; i < n; i++)
gap[i] = v[i + 1] - (v[i] + 1);
sort(gap + 1, gap + n);
long long ans = n;
for (int i = 1; i <= n - k; i++)
ans = ans + gap[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... |