Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- // *** Aliases
- typedef long long lli;
- typedef unsigned long long ulli;
- lli clamp(lli n, lli lower, lli upper) {
- return std::max(lower, std::min(n, upper));
- }
- int main() {
- cin.tie(0); ios_base::sync_with_stdio(0); // *** Fast input
- deque <lli> D;
- lli N, K; cin >> N >> K;
- lli highest = 0;
- for (lli i = 0; i < N; i++) {lli val; cin >> val; D.push_back(val);} // Insert into deque
- lli result = 0;
- while (D.size() > 0) {
- lli max = *max_element (D.begin(), D.begin()+clamp(K, 0, D.size()));
- for (ulli i = 0; i < D.size(); i++) {
- if (D[i] == max) {
- result += D[i];
- D.erase(D.begin() + i);
- if (result > highest) highest = result;
- break;
- }
- }
- }
- cout << highest;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement