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>
#define int long long
using namespace std;
signed main()
{
int n, k;
cin >> n >> k;
int a[n], b[n-1];
for(int i=0; i < n; i++)cin>>a[i];
for(int i=0; i < n-1; i++)b[i]=a[i]+1;
vector<int> raz;
for(int i=1; i < n; i++){
raz.push_back(a[i]-b[i-1]);
}
sort(raz.rbegin(),raz.rend());
int mx=a[n-1]+1-a[0];
int mn=k;
if(k==1)cout<<mx;
else if(k==n)cout<<mn;
else{
int br=k-1;
int x=0;
for(int i=0; i < br; i++){
x+=raz[i];
}
cout<<mx-x;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |