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;
const long long maxn = 2e5 + 12, mod = 998244353, inf = 1e9 + 12 ;
long long n, k, a[maxn];
vector <long long> pos;
int main(){
ios_base::sync_with_stdio(false), cin.tie(0);
cin >> n >> k;
for(int i = 0; i < n; i++)
cin >> a[i];
for(int i = 0; i < n - 1; i++)
pos.push_back(a[i + 1] - (a[i] + 1));
sort(pos.begin(), pos.end(), greater<long long>());
long long sum = 0;
k -= 1;
for(int i = 0; i < k; i++){
sum += pos[i];
}
cout << a[n - 1] + 1 - a[0] - sum << endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |