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;
using ll = long long;
const int MAXN = 1e6;
ll n, k;
ll t[MAXN];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; i++)
cin >> t[i];
vector<int> mmb;
for (int i = 0; i < n; i++)
if (i > 0)
mmb.push_back(t[i] - t[i - 1] - 1);
sort(mmb.rbegin(), mmb.rend());
cout << (t[n - 1] + 1) - t[0] - accumulate(mmb.begin(), mmb.begin() + k - 1, 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... |