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;
vector<int> a(n-1);
int f;
int s;
cin>>s;
for(int i = 0;i<n-1;i++){
cin>>f;
a[i] = f-s+1;
s = f;
}
if(k>=n){
cout<<n<<endl;
return 0;
}
sort(a.begin(),a.end());
int l = n - k;
int ans = 0;
int i = 0;
while(l>0){
ans+=a[i];
l--;
i++;
}
cout<<k-(n-k)+ans;
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... |