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 <bits/stdc++.h>
using namespace std;
int n, t, a[100002], ans;
int main()
{
cin >> n >> t;
vector<int>gap;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (i > 1)
gap.push_back(a[i] - a[i - 1] - 1);
}
ans = a[n];
sort(gap.begin(), gap.end(), greater<int>());
for (int i = 0; i < t - 1; i++)
ans -= gap[i];
cout << ans - a[1] + 1;
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... |