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> dist(n-1);
int last;
cin >> last;
for (int i= 1; i < n; i++)
{
int t;
cin >> t;
dist[i-1] = t-last-1;
last = t;
}
sort(dist.begin(), dist.end());
int sol = n;
for (int i = 0; i < n-k; i++) sol += dist[i];
cout << sol << "\n";
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... |