Advertisement
m2ansib

Catlunch

Dec 14th, 2019
154
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.75 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. // *** Aliases
  5. typedef long long lli;
  6. typedef unsigned long long ulli;
  7.  
  8. lli clamp(lli n, lli lower, lli upper) {
  9.   return std::max(lower, std::min(n, upper));
  10. }
  11.  
  12. int main() {
  13.     cin.tie(0); ios_base::sync_with_stdio(0); // *** Fast input
  14.     deque <lli> D;
  15.     lli N, K; cin >> N >> K;
  16.     lli highest = 0;
  17.     for (lli i = 0; i < N; i++) {lli val; cin >> val; D.push_back(val);} // Insert into deque
  18.     lli result = 0;
  19.     while (D.size() > 0) {
  20.         lli max = *max_element (D.begin(), D.begin()+clamp(K, 0, D.size()));
  21.         for (ulli i = 0; i < D.size(); i++) {
  22.             if (D[i] == max) {
  23.                 result += D[i];
  24.                 D.erase(D.begin() + i);
  25.                 if (result > highest) highest = result;
  26.                 break;
  27.             }
  28.         }
  29.     }
  30.     cout << highest;
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement