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;
#define int long long
signed main()
{
int n, k;
cin>>n>>k;
int a[n + 5];
priority_queue<int> q;
for(int i=0; i<n; i++)
{
cin>>a[i];
if (i) q.push(a[i] - a[i - 1] - 1);
}
int ans = a[n - 1] - a[0] + 1;
for(int i=0; i<k-1; i++)
{
// cout<<q.top()<<endl;
ans -= q.top();
q.pop();
}
cout<<ans<<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... |