58882023-10-04 18:16:21horkaUtazásszervezés (75 pont)cpp17Accepted 75/756ms3596 KiB
#include <bits/stdc++.h>
using namespace std;

int main()
{
	int vez,k,m,c; cin>>vez>>k>>m>>c;
	vector<int> igeny(c+1),napok(k+100);
	for(int i=1; i<=c; i++)
		{
			cin>>igeny[i];
			napok[igeny[i]]++;
		}
	vector<int> novel(k+100);
	int mo=0;
	for(int i=1; i<=k; i++)
	{
		vez+=novel[i];
		if(napok[i]==0 || vez==0) continue;
		if(napok[i]>=vez)
		{
			novel[i+m]+=vez;
			mo+=vez;
			vez=0;
		}
		else
		{
			novel[i+m]+=napok[i];
			mo+=napok[i];
			vez-=napok[i];
		}
	}
	cout<<mo<<endl;
	return 0;
}
SubtaskSumTestVerdictTimeMemory
base75/75
1Accepted0/03ms1812 KiB
2Accepted0/06ms2512 KiB
3Accepted3/33ms2268 KiB
4Accepted4/43ms2480 KiB
5Accepted4/42ms2516 KiB
6Accepted4/42ms2540 KiB
7Accepted4/43ms2744 KiB
8Accepted4/43ms3168 KiB
9Accepted5/53ms3204 KiB
10Accepted5/53ms3360 KiB
11Accepted6/64ms3596 KiB
12Accepted6/64ms3564 KiB
13Accepted6/64ms3560 KiB
14Accepted6/66ms3568 KiB
15Accepted6/66ms3580 KiB
16Accepted6/66ms3572 KiB
17Accepted6/66ms3580 KiB