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;
int main() {
int n,k; cin >> n >> k;
ll mxt = 0;
ll mnt = 1000000005;
vector<ll> dst;
cin >> mnt;
ll prev = mnt;
k--;
for(int i = 1; i < n; i++) {
ll t; cin >> t;
dst.push_back(t-prev-1);
mxt = max(mxt, t);
prev = t;
}
sort(dst.rbegin(), dst.rend());
ll eft = 0;
for(int i = 0; i < k; i++) {
eft += dst[i];
}
ll tet = mxt-mnt+1;
cout << tet-eft;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |