# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
206747 | pavement | Stove (JOI18_stove) | C++17 | 32 ms | 5500 KiB |
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
int N, K, C, T[100005];
vector<pair<int, int> > V;
vector<int> Y;
main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> N >> K;
for (int i = 1; i <= N; i++) {
cin >> T[i];
if (i != 1 && T[i - 1] + 1 == T[i]) {
auto ii = V.back();
V.pop_back();
V.emplace_back(ii.first, T[i] + 1);
} else V.emplace_back(T[i], T[i] + 1);
}
for (auto i : V)
C += i.second - i.first;
for (int i = 0; i < V.size() - 1; i++)
Y.push_back(V[i + 1].first - V[i].second);
sort(Y.begin(), Y.end());
for (int i = 1; i <= max((int)V.size() - K, 0ll); i++) C += Y[i - 1];
cout << C << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |