AtCoder Beginner Contest 142 - Roller Coaster

N friends of Takahashi has come to a theme park.
To ride the most popular roller coaster in the park, you must be at least K centimeters tall.
The i-th friend is h_i centimeters tall.
How many of the Takahashi's friends can ride the roller coaster?

-----Constraints-----
 -  1 \le N \le 10^5 
 -  1 \le K \le 500 
 -  1 \le h_i \le 500
 - All values in input are integers.

-----Input-----
Input is given from Standard Input in the following format:
N K
h_1 h_2 \ldots h_N

-----Output-----
Print the number of people among the Takahashi's friends who can ride the roller coaster.

-----Sample Input-----
4 150
150 140 100 200

-----Sample Output-----
2

Two of them can ride the roller coaster: the first and fourth friends.

Difficulty: EASY

Starter code:

Solutions:
(n, k) = list(map(int, input().split(' ')))
h = list(map(int, input().split(' ')))
print(sum((i >= k for i in h)))


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in range(n):
	if h[i] >= k:
		ans += 1
print(ans)


(n, k) = map(int, input().split())
print(len([int(i) for i in input().split() if int(i) >= k]))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
ans = 0
for h in H:
	if h >= K:
		ans += 1
print(ans)


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
ans = sum((x >= k for x in h))
print(ans)


(n, k) = map(int, input().split())
print(len([h for h in input().split() if int(h) >= k]))


(N, K, *h) = map(int, open(0).read().split())
ans = 0
for i in h:
	if K <= i:
		ans += 1
print(ans)


(n, k) = map(int, input().split())
print(sum([h >= k for h in map(int, input().split())]))


(n, k) = map(int, input().split())
L = list(map(int, input().split()))
print(sum((x >= k for x in L)))


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
h_l = [int(i) for i in h if i >= K]
print(len(h_l))


(n, k) = list(map(int, input().split()))
h = list(map(int, input().split()))
count = 0
for i in range(0, len(h)):
	if h[i] == k or h[i] >= k:
		count += 1
	else:
		count += 0
print(int(count))


(N, K, *H) = map(int, open(0).read().split())
print(sum((e >= K for e in H)))


(n, m) = map(int, input().split())
l = [i for i in input().split() if int(i) >= m]
print(len(l))


(n, k) = map(int, input().split())
print(sum((1 for x in map(int, input().split()) if x >= k)))


(n, k, *h) = map(int, open(0).read().split())
print(sum([1 if h[i] >= k else 0 for i in range(n)]))


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
a = 0
for i in h:
	if i >= K:
		a += 1
print(a)


(N, K) = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
print(len([i for i in a if i >= K]))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
print(sum((x >= K for x in H)))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
print(len(list(filter(lambda x: x >= K, H))))


(_, k) = map(int, input().split())
print([i >= k for i in list(map(int, input().split()))].count(1))


(n, k) = map(int, input().split())
s = 0
for m in map(int, input().split()):
	if m >= k:
		s += 1
print(s)


(N, K) = [int(i) for i in input().split()]
print(len([0 for i in input().split() if int(i) >= K]))


(n, k) = map(int, input().split())
a = map(lambda x: int(x) >= k, input().split())
print(sum(a))


(n, k) = map(int, input().split())
li = list(map(int, input().split()))
cnt = 0
for i in li:
	if i >= k:
		cnt += 1
print(cnt)


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
print(len([1 for x in h if x >= K]))


f = lambda : map(int, input().split())
(_, k) = f()
print(sum((i >= k for i in f())))


(n, limit) = map(int, input().split())
lst = list(map(int, input().split()))
count = 0
for i in range(n):
	if lst[i] >= limit:
		count += 1
print(count)


(n, k) = input().split(' ')
h = input().split(' ')
c = 0
for i in h:
	if int(i) >= int(k):
		c += 1
print(c)


from bisect import bisect_left
(n, k) = list(map(int, input().split()))
h = list(map(int, input().split()))
h.sort()
i = bisect_left(h, k)
print(n - i)


(n, k) = map(int, input().split())
print(sum(list(map(lambda x: int(x) >= k, input().split()))))


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
ok = [x for x in h if x >= k]
print(len(ok))


(n, k) = map(int, input().split())
h = map(int, input().split())
print(sum([1 for i in h if i >= k]))


(n, k) = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for i in range(n):
	cnt += H[i] >= k
print(cnt)


(N, K) = map(int, input().split())
ary1 = map(int, input().split())
print(sum((x >= K for x in ary1)))


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
print(sum([t >= K for t in h]))


(n, k) = [int(_) for _ in input().split()]
print(sum([int(_) >= k for _ in input().split()]))


(N, K) = map(int, input().split())
(*H,) = map(int, input().split())
print(sum((h >= K for h in H)))


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
print(sum((1 if t >= K else 0 for t in h)))


(n, k, *h) = map(int, open(0).read().split())
print(sum((x >= k for x in h)))


(n, k) = map(int, input().split())
l = map(int, input().split())
print(sum(map(lambda x: 1 if x >= k else 0, l)))


(n, k) = [int(i) for i in input().split()]
ans = [i for i in input().split() if int(i) >= k]
print(len(ans))


(N, K) = map(int, input().split())
i = list(map(int, input().split()))
ans = 0
for hi in i:
	if hi >= K:
		ans += 1
print(ans)


(N, K) = map(int, input().split())
cnt = sum((int(i) >= K for i in input().split()))
print(cnt)


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in range(N):
	if h[i] >= K:
		ans += 1
print(ans)


(n, k) = map(int, input().split())
(*h,) = map(int, input().split())
print(sum(map(lambda x: x >= k, h)))


3
import sys
input = lambda : sys.stdin.readline().strip()
(n, k) = [int(x) for x in input().split()]
h = [int(x) for x in input().split()]
print(sum((1 for x in h if x >= k)))


(N, K) = map(int, input().split())
h = map(int, input().split())
print(len([o for o in h if o >= K]))


(n, k) = map(int, input().split())
l = sorted(list(map(int, input().split())) + [k])
print(n - l.index(k))


(n, k) = map(int, input().split())
ans = 0
for i in map(int, input().split()):
	ans += i >= k
print(ans)


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
c = 0
for x in h:
	c += x >= k
print(c)


(_, k) = map(int, input().split())
print(sum((1 for h in map(int, input().split()) if h >= k)))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
print(sum((1 for h in H if h >= K)))


S_list = [input() for i in range(2)]
(N, K) = map(int, S_list[0].split())
h_list = list(map(int, S_list[1].split()))
number = 0
for i in h_list:
	if i >= K:
		number += 1
print(number)


(n, k) = map(int, input().split())
lh = list(map(int, input().split()))
la = [i for i in lh if i >= k]
print(len(la))


(N, K) = map(int, input().split())
li_h = list(map(int, input().split()))
print(sum((i >= K for i in li_h)))


(N, K) = map(int, input().split())
h_n = map(int, input().split())
print(sum([i >= K for i in h_n]))


(n, k, *A) = map(int, open(0).read().split())
print(sum((a >= k for a in A)))


(N, K) = map(int, input().split())
print(len([0 for x in map(int, input().split()) if x >= K]))


(n, k) = map(int, input().split())
xlist = list(map(int, input().split()))
count = 0
for i in range(n):
	if xlist[i] >= k:
		count += 1
print(count)


li = lambda : list(map(int, input().split()))
(n, k) = li()
h = li()
print(sum((hh >= k for hh in h)))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
answer = 0
for i in range(N):
	if H[i] >= K:
		answer += 1
print(answer)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
o = [x for x in l if x >= k]
print(len(o))


(N, K) = input().split()
print(sum([1 for i in input().split() if int(K) <= int(i)]))


(num_persons, need_height) = list(map(int, input().split()))
a = list(map(int, input().split()))
height_list = list(a)
count_height_ok = 0
for i in height_list:
	if i >= need_height:
		count_height_ok += 1
print(count_height_ok)


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
c = 0
for e in h:
	if e >= k:
		c += 1
print(c)


(a, b) = map(int, input().split())
print(len([i for i in map(int, input().split()) if i >= b]))


(n, k) = map(int, input().split())
H = list(map(int, input().split()))
ans = 0
for h in H:
	if h >= k:
		ans += 1
print(ans)


(N, K) = map(int, input().split())
H = input().split()
c = 0
for t in list(H):
	if int(t) >= K:
		c += 1
print(c)


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
print(sum((h[i] >= K for i in range(N))))


(_, k) = map(int, input().split())
l = map(int, input().split())
print(sum((1 for i in l if i >= k)))


import numpy as np
(N, K) = map(int, input().split())
h = np.array(list(map(int, input().split())))
print(np.sum(h >= K))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
print(sum(map(lambda x: x >= K, H)))


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
ok = [i for i in H if i >= K]
print(len(ok))


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
print(len([h[i] for i in range(n) if h[i] >= k]))


(N, K, *H) = map(int, open(0).read().split())
A = 0
for i in H:
	A += 1 * (i >= K)
print(A)


(n, k) = map(int, input().split())
h = input().split()
a = 0
for i in h:
	if int(i) >= k:
		a += 1
print(a)


(n, k) = map(int, input().split())
print(len([0 for x in input().split() if int(x) >= k]))


def atc_142b(NK_input: str, hi_input: str) -> int:
	(N, K) = list(map(int, NK_input.split(' ')))
	hi = [int(i) for i in hi_input.split(' ')]
	hi = sorted(hi)
	for i in range(0, len(hi)):
		if hi[i] >= K:
			return len(hi) - i
	return 0
NK_input_value = input()
hi_input_value = input()
print(atc_142b(NK_input_value, hi_input_value))


(N, K) = [int(i) for i in input().split()]
h = [i for i in input().split() if int(i) >= K]
print(len(h))


(N, K, *H) = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))


(x, y) = map(int, input().split())
num_list = [num for num in map(int, input().split()) if num >= y]
print(len(num_list))


(n, m) = map(int, input().split())
h = [int(_) for _ in input().split()]
print(len([i for i in h if i >= m]))


(n, k, *h) = map(int, open(0).read().split())
print(len([x for x in h if x >= k]))


(N, K) = map(int, input().split())
h = map(int, input().split())
ride = 0
for cm in h:
	if cm >= K:
		ride = ride + 1
	else:
		continue
print(ride)


(N, K) = map(int, input().split())
h = map(int, input().split())
print(sum((1 for x in h if x >= K)))


(mem_num, over_height) = map(int, input().split())
members_hgt = list(map(int, input().split()))
cnt = 0
for i in members_hgt:
	if i >= over_height:
		cnt += 1
print(cnt)


(N, K) = map(int, input().split())
List = list(map(int, input().split()))
print(sum((1 for x in List if x >= K)))


(N, K) = map(int, input().split())
print([int(i) >= K for i in input().split()].count(True))


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
cn = sum((hi >= k for hi in h))
print(cn)


import bisect

def resolve():
	(n, k) = map(int, input().split())
	h = sorted(list(map(int, input().split())))
	print(n - bisect.bisect_left(h, k))
resolve()


(n, k) = map(int, input().split())
a = input().split()
sum = 0
for i in a:
	sum += int(int(i) >= k)
print(sum)


(_, K) = map(int, input().split())
print(len([int(x) for x in input().split() if int(x) >= K]))


(n, k) = map(int, input().split())
l = [int(i) for i in input().split()]
print(sum((i >= k for i in l)))


(N, K) = map(int, input().split())
hi = list(map(int, input().split()))
HI = [i for i in hi if i >= K]
print(len(HI))


(N, K) = map(int, input().split())
heights = list(map(int, input().split()))
result = 0
for h in heights:
	if h >= K:
		result += 1
print(result)


(N, K) = map(int, input().split())
H = map(int, input().split())
height_list = list(H)
ride = 0
for i in height_list:
	if i >= K:
		ride += 1
print(ride)


(N, K) = [int(i) for i in input().split()]
print(sum((int(i) >= K for i in input().split())))


(n, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
res = 0
for i in range(n):
	if k <= a[i]:
		res += 1
print(res)


(N, K) = map(int, input().split())
H = map(int, input().split())
print(sum((i >= K for i in H)))


(N, K) = map(int, input().split())
h = list(map(int, input().split()))
n = sum((x >= K for x in h))
print(n)


(n, k) = map(int, input().split())
l = list(map(int, input().split()))
c = len([a for a in l if a >= k])
print(c)


(N, K, *h) = map(int, open(0).read().split())
print(sum((1 for i in filter(lambda x: K <= x, h))))


(N, K) = map(int, input().split())
S = map(int, input().split())
height_list = list(S)
ride_person = 0
for i in height_list:
	if i >= K:
		ride_person += 1
print(ride_person)


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
d = [i for i in c if i >= b]
print(len(d))


(_, K, *H) = map(int, open(0).read().split())
print(len(tuple(filter(lambda h: h >= K, H))))


(N, Y) = [int(i) for i in input().split()]
n = list(map(int, input().split()))
print(sum((x >= Y for x in n)))


(N, K) = map(int, input().split())
H = map(lambda x: 0 if int(x) < K else 1, input().split())
print(sum(H))


(N, K) = map(int, input().split())
data = list(map(int, input().split()))
cnt = 0
for i in range(len(data)):
	if data[i] >= K:
		cnt += 1
print(cnt)


K = int(input().split()[1])
print(sum([h >= K for h in map(int, input().split())]))


(a, b) = map(int, input().split())
i = list(map(int, input().split()))
j = [x for x in i if x >= b]
print(len(j))


(N, K) = map(int, input().split())
friend = list(map(int, input().split()))
clear = []
for i in friend:
	if i >= K:
		clear.append(i)
print(len(clear))


(n, k, *h) = map(int, open(0).read().split())
print(sum([1 for height in h if height >= k]))


(n, k) = map(int, input().split())
h = list(map(int, input().split()))
count = 0
for i in h:
	if i >= k:
		count += 1
print(count)


(n, k) = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
cnt = 0
for hi in h:
	if hi >= k:
		cnt += 1
print(cnt)


(n, k) = map(int, input().split())
d = list(map(int, input().split()))
print([x >= k for x in d].count(True))


(total_people, min_height) = map(int, input().split())
height = map(int, input().split())
rideable_people = 0
for i in height:
	if i >= min_height:
		rideable_people += 1
print(rideable_people)


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
print(sum((1 for i in a if i >= k)))


(n, k) = map(int, input().split())
heights = list(map(int, input().split()))
count = 0
for height in heights:
	if k <= height:
		count = count + 1
print(count)


(n, k) = map(int, input().split())
list01 = input().split()
list02 = [int(a) for a in list01]
x = 0
for i in list02:
	if i >= k:
		x += 1
	else:
		pass
print(x)


(N, K) = map(int, input().split())
height = list(map(int, input().split()))
availability = 0
for i in range(0, N):
	if height[i] >= K:
		availability += 1
print(availability)


(n, k) = [int(i) for i in input().split()]
a = [int(i) >= k for i in input().split()]
print(sum(a))


(N, K) = map(int, input().split())
vA = list(map(int, input().split()))
print(sum((a >= K for a in vA)))


(N, K) = list(map(int, input().split()))
h = input()

def ans142(N: int, K: int, h: list):
	N = int(N)
	K = int(K)
	count = 0
	if N == 1:
		h = int(h)
		if h >= K:
			return 1
		elif h < K:
			return 0
	else:
		h = h.split()
		for i in range(0, N):
			if int(h[i]) >= K:
				count += 1
		return count
print(ans142(N, K, h))


(N, K) = map(int, input().split())
h = [int(x) for x in input().split()]
ans = sum((x >= K for x in h))
print(ans)


(A, K) = [int(x) for x in input().split()]
print(sum((int(x) >= K for x in input().split())))


(n, k) = [int(x) for x in input().split()]
print(sum((True for i in input().split() if int(i) >= k)))


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
o = 0
i = 0
for i in range(n):
	if a[i] >= k:
		o += 1
print(o)


(N, K) = map(int, input().split())
l = list(map(int, input().split()))
cnt = 0
for i in l:
	if i >= K:
		cnt = cnt + 1
print(cnt)


(N, K) = list(map(int, input().split()))
my_list = list(map(int, input().split(maxsplit=N)))
answer = 0
for i in range(0, N):
	if my_list[i] >= K:
		answer += 1
print(answer)


(n, k) = map(int, input().split())
ans = sum((i >= k for i in map(int, input().split())))
print(ans)


(N, K) = list(map(int, input().split()))
h = list(map(int, input().split()))
possible = []
for i in h:
	if i >= K:
		possible.append(i)
print(len(possible))


(n, k) = map(int, input().split())
print(len(list(filter(lambda hi: hi >= k, map(int, input().split())))))


(n, k, *h) = map(int, open(0).read().split())
print(sum(map(lambda x: x >= k, h)))


(N, K) = list(map(int, input().split()))
H = list(map(int, input().split()))
s = 0
for i in H:
	if K <= i:
		s += 1
print(s)


(a, b) = map(int, input().split())
c = map(int, input().split())
d = 0
for x in c:
	if x >= b:
		d += 1
print(d)


(N, K) = map(int, input().split())
print(sum(map(lambda x: x >= K, map(int, input().split()))))


def answer(n: int, k: int, h: []) -> int:
	return len(list((i for i in h if k <= i)))

def main():
	(n, k) = list(map(int, input().split()))
	h = list(map(int, input().split()))
	print(answer(n, k, h))

def __starting_point():
	main()
__starting_point()


(n, k, *h) = map(int, open(0).read().split())
j = 0
for i in range(n):
	if h[i] >= k:
		j += 1
print(j)


import numpy as np
(n, k) = list(map(int, input().split()))
h = np.array(list(map(int, input().split())))
print(np.count_nonzero(h - k >= 0))


a = 0
k = int(input().split()[1])
l = list(map(int, input().split()))
for i in l:
	if i >= k:
		a += 1
print(a)


(N, K) = map(int, input().split())
H = list(map(int, input().split()))
S = 0
for h in H:
	S += h >= K
print(S)


(n, k) = map(int, input().split())
ans = 0
for h in map(int, input().split()):
	ans += h >= k
print(ans)


(_, K) = map(int, input().split())
h = list(map(int, input().split()))
print(sum([c >= K for c in h]))


(N, K) = [int(n) for n in input().split()]
h = [int(n) for n in input().split() if int(n) >= K]
print(len(h))


R = lambda : map(int, input().split())
(n, k) = R()
print(sum((x >= k for x in R())))


(_, k, *h) = map(int, open(0).read().split())
print(sum([i >= k for i in h]))


(N, M) = (int(i) for i in input().split(' '))
print(sum([int(i) >= M for i in input().split()]))


(n, k) = list(map(int, input().split()))
friend = list(map(int, input().split()))
count = 0
for x in friend:
	if x >= k:
		count += 1
print(count)