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 <iostream>
#include <set>
using namespace std;
const int maxN = 1e5;
int n, k, res;
int T[maxN];
multiset<int, greater<int> > helper;
int main() {
cin >> n >> k >> T[0];
for(int i = 1; i < n; i++)
{
cin >> T[i];
helper.insert(T[i] - T[i - 1]);
}
res = T[n - 1] - T[0];
for(int i = 1; i < k; i++)
{
res -= *helper.begin();
helper.erase(helper.begin());
}
cout << res + k;
return 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... |