# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
657810 | OgradL | Stove (JOI18_stove) | C++14 | 48 ms | 3520 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 <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define ll long long
#define p pair<int, int>
#define mkp make_pair
#define pb push_back
int main() {
int N, K;
cin >> N >> K;
vector<ll> T(N);
for (ll &n: T) cin >> n;
vector<p> R;
//vector<int> siz;
int start = T[0];
for (int i = 0; i < N; i++){
if (i == N - 1){
R.pb(mkp(start, T[i]+1));
//cout << start << " " << T[i]+1 << "\n";
} else if (T[i] + 1 != T[i + 1]){
R.pb(mkp(start, T[i]+1));
//siz.pb(T[i]+1 - start);
//cout << start << " " << T[i]+1 << "\n";
start = T[i + 1];
}
}
//cout << "\n\n\n";
vector<int> siz;
for (int i = 0; i < R.size() - 1; i++){
siz.pb(R[i+1].first - R[i].second);
//cout << R[i].second << " " << R[i+1].first << " " << R[i+1].first - R[i].second << "\n";
}
sort(siz.begin(), siz.end(), greater<int>());
ll sum = 0;
for (int i = 0; i < K - 1 && i < siz.size(); i++){
sum += siz[i];
//cout << siz[i] << "\n";
}
//cout << T[N-1] << " " << T[0] << " " << sum << "\n";
cout << T[N-1]+1-T[0]-sum << "\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... |