Submission #9,016

2024-02-12 10:39:17

cpp17

Accepted 75/75

6ms

3956 KiB

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
#include <queue>
using namespace std;

int main() {
	int n, k, m, c;
	cin >> n >> k >> m >> c;
	priority_queue<int> end;
	int db = 0;
	for (int i = 0; i < c; i++) {
		int ig;
		cin >> ig;
		while (end.size() > 0 && end.top() >= -ig) end.pop();
		if (end.size() < n) {
			db++;
			end.push(-ig - m);
		}
	}

	cout << db;
}

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	3ms	2088 KiB
		2	Accepted	0/0	6ms	2312 KiB
		3	Accepted	3/3	3ms	2572 KiB
		4	Accepted	4/4	2ms	2520 KiB
		5	Accepted	4/4	3ms	2708 KiB
		6	Accepted	4/4	3ms	2828 KiB
		7	Accepted	4/4	3ms	3168 KiB
		8	Accepted	4/4	3ms	3168 KiB
		9	Accepted	5/5	3ms	3248 KiB
		10	Accepted	5/5	3ms	3380 KiB
		11	Accepted	6/6	4ms	3596 KiB
		12	Accepted	6/6	4ms	3672 KiB
		13	Accepted	6/6	4ms	3700 KiB
		14	Accepted	6/6	6ms	3688 KiB
		15	Accepted	6/6	6ms	3956 KiB
		16	Accepted	6/6	6ms	3868 KiB
		17	Accepted	6/6	6ms	3884 KiB