248682026-02-16 10:33:37SzeredaiNatanaelLeggyorsabb pénzkeresés (50)cpp17Wrong answer 0/5030ms1076 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
	int n, k; cin >> n >> k;
	vector<int> v(n);
	for (int i = 0; i < n; ++i)
		cin >> v[i];
	
	if (k <= 10000) {
		sort(v.begin(), v.end());
		if(v[0] >= k) {
			cout << 1;
			return 0;
		}
	}
}
SubtaskSumTestVerdictTimeMemory
base0/50
1Wrong answer0/01ms316 KiB
2Wrong answer0/029ms808 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/24ms316 KiB
7Wrong answer0/24ms316 KiB
8Wrong answer0/24ms316 KiB
9Wrong answer0/24ms316 KiB
10Wrong answer0/24ms316 KiB
11Wrong answer0/228ms564 KiB
12Wrong answer0/229ms812 KiB
13Wrong answer0/229ms564 KiB
14Wrong answer0/229ms756 KiB
15Wrong answer0/230ms1036 KiB
16Wrong answer0/229ms564 KiB
17Wrong answer0/229ms564 KiB
18Wrong answer0/229ms564 KiB
19Wrong answer0/229ms600 KiB
20Wrong answer0/229ms564 KiB
21Wrong answer0/228ms564 KiB
22Wrong answer0/229ms1076 KiB
23Wrong answer0/229ms564 KiB
24Wrong answer0/229ms564 KiB
25Wrong answer0/229ms564 KiB
26Wrong answer0/229ms564 KiB
27Wrong answer0/229ms564 KiB