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;
int main()
{
int n,k;
cin>>n>>k;
int a[n];
// vector< pair<int,int> >par;
int sum=0;
for(int i=0;i<n;i++)
{
cin>>a[i];
sum=sum+a[i];
//par.push_back(make_pair(a[i],a[i]+1));
}
if(k==1)
{
cout<<sum<<endl;
return 0;
}
if(k==n)
{
cout<<k<<endl;
return 0;
}
int kk=a[n-1]-a[0]+2;
vector<int>v;
for(int i=0;i<=(n-2);i++)
{
v.push_back(a[i+1]-a[i]-1);
}
sort(v.begin(),v.end());
int j=v.size()-1;
while(k>0)
{
kk=kk-v[j];
j--;
k--;
}
cout<<kk<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |