Submission #666407

#	Time	Username	Problem	Language	Result	Execution time	Memory
666407		MilosMilutinovic	The short shank; Redemption (BOI21_prison)	C++17	0 / 100	63 ms	9036 KiB

prison

/**
 *    author:  wxhtzdy
 *    created: 28.11.2022 15:11:47
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n, d, t;
  cin >> n >> d >> t;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int lst = -1;
  vector<int> cnt(n);
  for (int i = 0; i < n; i++) {
    if (a[i] <= t) {
      lst = i;
    } else {
      if (lst != -1) {
        cnt[lst] += 1;
      }
    }
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] <= t) {
      ans += cnt[i] + 1;
    }
  }
  sort(cnt.rbegin(), cnt.rend());
  for (int i = 0; i < d; i++) {
    ans -= cnt[i];
  }       
  cout << ans << '\n';
  return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20