| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1053238 | vjudge1 | The short shank; Redemption (BOI21_prison) | C++17 | 1 ms | 604 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>
#include <cassert>
#warning That's not the baby, that's my baby
#define debug(x) #x << " = " << x << '\n'
typedef long long ll;
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  #ifdef LOCAL
freopen("input.txt", "r", stdin);
  #endif
  
  int n, D, T;
	std::cin >> n >> D >> T;
	std::vector<int> v;
	int y = T + 1;
	int answer = n;
	for (int i = 1; i <= n; i++) {
		int x;
		std::cin >> x;
		if (x > T) {
			if (y > T) {
				v.back()++;
			} else {
				v.push_back(1);
			}
		}
		y = x;
	}
	std::sort(v.begin(), v.end());
	std::reverse(v.begin(), v.end());
	for (int i = 0; i < D && i < (int) v.size(); i++) {
		answer -= v[i];
	}
	std::cout << answer;
  return 0;
}
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... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
