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;
long long a[100001];
int n,k;
priority_queue<long long>b;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
//freopen(".INP","r",stdin);
// freopen(".OUT","w",stdout);
cin>>n>>k;
for (int i=1;i<=n;i++)cin>>a[i];
for (int i=1;i<n;i++)b.push(a[i+1]-a[i]);
long long ans=k+a[n]-a[1];
k--;
while (k>0&&b.empty()==false){
ans-=b.top();
b.pop();
k--;
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |