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;
#define int long long
signed main()
{
int n , k;
cin >> n >> k;
vector<int> a(n) , b;
for (int i = 0; i < n; i++){
cin >> a[i];
if (i > 0)
b.push_back(a[i] - (a[i - 1]) - 1);
}
sort(b.rbegin() , b.rend());
int m = (int)b.size();
vector<int> pf(b.begin() , b.end());
for (int i = 1; i < m; i++)
pf[i] += pf[i - 1];
if (k == 1)
cout << a[n - 1] - a[0] + 2;
else
cout << a[n - 1] - pf[k - 2] << "\n";
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |