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>
int n,k;
long long t[100100],ans;
using namespace std;
priority_queue<long long> pq;
int main()
{
cin>>n>>k;
for(int i=0;i<n;i++)
cin>>t[i];
sort(t,t+n);
ans=t[n-1]+1-t[0];
for(int i=0;i<n-1;i++)
pq.push(t[i+1]-t[i]-1);
k--;
while(!pq.empty()&&k--)
{
ans-=pq.top();
pq.pop();
}
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... |