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 f first
#define s second
using namespace std;
int main() {
int n, k;
cin >> n >> k;
long long mas[n], df[n-1], sm=0;
for(int i=0; i<n; i++){
cin >> mas[i];
if(i>0){
df[i-1]=mas[i]-mas[i-1]-1;
}
}
sort(df, df+n-1);
for(int i=0; i<n-k; i++){
sm+=df[i];
}
cout <<sm+n;
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... |