4562 2023. 03. 29 19:32:18 Kevin Utazásszervezés (75 pont) cpp17 Wrong answer 19/75 8ms 3620 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, m, c, megoldas, igeny;
	bool megvan=false;
	cin >> n;
	cin >> m;
	cin >> m;
	cin >> c;
	vector<int> vec(n);
	megoldas=n;
	if (c<n)
		megoldas=c;
	for (int i=0; i<megoldas; i++){
		cin >> vec[i];
		vec[i]=vec[i]+m-1;
	}
	for (int i=0; i<c-n; i++){
		cin >> igeny;
		for (int y=0; y<n&&megvan==false; y++){
			if (vec[y]<igeny){
				megoldas++;
				vec[y]=igeny+m-1;
				megvan=true;
			}
			megvan=false;
			sort(vec.begin(), vec.end());
		}
	}
	cout << megoldas;
	}
Subtask Sum Test Verdict Time Memory
base 19/75
1 Accepted 0/0 3ms 1812 KiB
2 Wrong answer 0/0 8ms 2200 KiB
3 Accepted 3/3 3ms 2132 KiB
4 Accepted 4/4 3ms 2340 KiB
5 Accepted 4/4 3ms 2572 KiB
6 Accepted 4/4 3ms 2740 KiB
7 Accepted 4/4 2ms 2728 KiB
8 Wrong answer 0/4 3ms 2832 KiB
9 Wrong answer 0/5 3ms 2940 KiB
10 Wrong answer 0/5 3ms 3024 KiB
11 Wrong answer 0/6 4ms 3060 KiB
12 Wrong answer 0/6 6ms 3132 KiB
13 Wrong answer 0/6 6ms 3244 KiB
14 Wrong answer 0/6 7ms 3304 KiB
15 Wrong answer 0/6 8ms 3516 KiB
16 Wrong answer 0/6 8ms 3620 KiB
17 Wrong answer 0/6 8ms 3548 KiB