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 main()
{
int n,k;
cin >> n >> k;
vector<int>t(n+1);
vector<int>d(n+1);
for(int i = 1; i <=n;i++)
{
cin >> t[i];
}
for(int i = 2; i <=n;i++)
{
d[i] = t[i] -t[i-1]-1;
}
sort(d.begin(),d.end());
int ans = t[n] - t[1] +1;
for(int i = n; i > n- k+1; i--) {
ans -= d[i];
}
cout << ans << '\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... |