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 <queue>
#include <vector>
#define int long long
using namespace std;
int a[200005];
int32_t main()
{
int n, k;
cin >> n >> k;
priority_queue<int, vector<int>, greater<int>> pq;
int tr = 1;
for (int i = 0; i < n; i++)
{
cin >> a[i];
if (i && a[i] != a[i-1]+1)
{
tr++;
pq.push(a[i]-a[i-1]-1);
}
}
int rez = n;
while (tr > k)
{
rez += pq.top();
pq.pop();
tr--;
}
cout << rez << "\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... |