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;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
int main(){
int n,k,out=0;
cin>>n>>k;
vi v(n);
vi gap(n-1);
for(int i=0;i<n;i++){
cin>>v[i];
}
for(int i=0;i<n-1;i++){
gap[i]=v[i+1]-v[i]-1;
}
out=v[n-1]+1-v[0];
sort(gap.rbegin(),gap.rend());
for(int i=0;i<k-1;i++){
out-=gap[i];
}
cout<<out;
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... |