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() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, k;
cin >> n >> k;
int t[n], s = n, m = n-k+1;
for(int loop = 0; loop < n; ++loop) {
cin >> t[loop];
}
for(int loop = 0; loop < n-1; ++loop) {
t[loop] = t[loop+1] - t[loop] - 1;
}
t[n-1] = 0;
sort(t, t+n);
for(int loop = 0; loop < m; ++loop) {
s += t[loop];
}
cout << s;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |