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;
vector<long long> v;
int main()
{
long long n,k;
cin>>n>>k;
priority_queue<long long> q;
for (long long i=0;i<n;i++)
{
long long a;
cin>>a;
v.push_back(a);
if (i>0) q.push(-(v[i]-v[i-1]-1));
}
long long odg=n;
for (long long i=n;i>k;i--)
{
long long x = abs(q.top());
q.pop();
//cout<< "dodava "<<x<<endl;
odg+=x;
}
cout<<odg<<endl;
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... |