Problem:
 Score : 200 points    Problem Statement  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 1 4 150
150 140 100 200      Sample Output 1 2  Two of them can ride the roller coaster: the first and fourth friends.       Sample Input 2 1 500
499      Sample Output 2 0       Sample Input 3 5 1
100 200 300 400 500      Sample Output 3 5

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)




import numpy as np

N, K = map(int, readline().split())
h = [int(x) - K for x in readline().split()]



print(len([x for x in h if x >= 0]))

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)




import numpy as np

N, K = map(int, readline().split())
h = [int(x) - K for x in readline().split()]
ha = np.array(h)

print(np.count_nonzero(ha >= 0))

Solution (Python):



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

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

cnt = 0
for i in h : 
    if i >= K : 
        cnt += 1
        
print(cnt)

Solution (Python):
import sys

[n, k] = [int(x) for x in sys.stdin.readline().split(" ")]

hs = [int(h) for h in sys.stdin.readline().split(" ")]

oks = [h for h in hs if h >= k]

print(len(oks))

Solution (Python):
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)

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

Solution (Python):
k,m  = map(int,input().split(" "))
nums = list(map(int,input().split(" ")))
ans = 0
for i in nums:
  if i>= m:
    ans += 1
print(ans)

Solution (Python):
def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    res = filter(lambda i:True if i >= k else False, h)

    print(sum(1 for _ in res))

if __name__ == '__main__':
    main()

Solution (Python):
N, K = map(int, input().split(' '))
h = [int(s) for s in input().split(' ')]

num = 0

for i in (range(len(h))):
    if h[i] >= K:
        num += 1

print(num)

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

Solution (Python):
A, B = map(int, input().split())

import numpy as np
li = np.array(list(map(int, input().split())))

print(len(li[li>=B]))

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
if h[0] < K:
    print(0)
    exit()
start = 0
end = N
while start < end-1:
    mid = (end+start)//2
    if h[mid] >= K:
        start = mid
    else:
        end = mid
print(start+1)

Solution (Python):
N, K = map(int, input().split())
d = list(map(int, input().split()))
c = 0

for i in range(N):
    if d[i]>= K:
        c += 1
print(c)

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

ans_list = [i for i in h if i >= K]
print(len(ans_list))

Solution (Python):
n, k = input().split()
n = int(n)  
k = int(k)  
h = input().split()

a = 0
for i in range(n):
  if int(h[i]) >= k:
    a += 1
print(a)

Solution (Python):
a, b = map(int,input().split())
l = list(map(int,input().split()))
x=0

for i in range(a):
    if l[i] >= b:
        x +=1

print(x)

Solution (Python):
n,k = input().split(' ')
h = int(k)
a = list(map(int, input().split(' ')))
ans = 0

for i in a:
  if i >= h:
    ans += 1

print(str(ans))

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

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

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

Solution (Python):
n,k = map(int,input().split())
lst = list(map(int,input().split()))

ans = 0
for i in range(n):
    if lst[i]>=k:
        ans += 1
print(ans)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,k = LI()
    a = LI()

    return len([c for c in a if c >= k])


print(main())

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

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

Solution (Python):



def main():

    n, limit = map(int, input().split(' '))
    heights = list(map(int, input().split(' ')))
    heights = sorted(heights, reverse=True)

    nakama_count = 0
    for height in heights:
        if height >= limit:
            nakama_count += 1
        else:
            break

    print(nakama_count)

    return 0
    
    
if __name__ == '__main__':
    main()

Solution (Python):

import numpy as np


def main():

    _, limit = map(int, input().split(' '))
    heights = np.array(list(map(int, input().split(' '))))

    print(np.count_nonzero(heights >= limit))

    return 0
    
    
if __name__ == '__main__':
    main()

Solution (Python):



def main():
    n, k = map(int, input().split(' '))
    heights = list(map(int, input().split(' ')))
    
    print(len([i for i in heights if i >= k]))
    
    return 0
    
    
if __name__ == '__main__':
    main()

Solution (Python):



def main():

    n, limit = map(int, input().split(' '))
    heights = list(map(int, input().split(' ')))

    nakama_count = 0
    for height in heights:
        if height >= limit:
            nakama_count += 1

    print(nakama_count)

    return 0
    
    
if __name__ == '__main__':
    main()

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

Solution (Python):
def main():
    N, K = map(int, input().split(" "))
    h = input().split(" ")
    ans = 0
    for i in h:
        if K <= int(i):
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

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

Solution (Python):
n,k = map(int,input().split())
h = list(map(int,input().split()))
cnt = 0

for i in range(n):
 if h[i] >= k:
  cnt += 1
print(cnt)

Solution (Python):
import sys
input = sys.stdin.readline
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
cnt=0
for i in range(n):
    if h[i]>=k:
        cnt+=1

print(cnt)

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

print(ans)

Solution (Python):

"""
Created on Thu Jan  2 16:11:53 2020

@author: student2
"""
n, k = map(int,input().split())

prijatelji = map(int, input().split())

x=0

for i in prijatelji:
    if i >= k:
        x = x+1
print (x)

Solution (Python):
n,k=map(int,input().split(" "))
li=(list(input().split(" ")))
br=0
for i in range(len(li)):
    li[i]=int(li[i])
for i in range(len(li)):
    if li[i]>=k:
        br+=1
print(br)

Solution (Python):
n,k = map(int,input().split())
h_lst = list(map(int,input().split()))

array = []
for i in range(n):
    if h_lst[i] >= k:
        array.append(h_lst[i])
print(len(array))

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))

sum = 0
for i in range(n):
    if h[i] >= k:
        sum += 1
print(sum)

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

Solution (Python):
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)

Solution (Python):
n , k = map(int,input().split())
li = list(map(int,input().split()))
li_sort = sorted(li)
ans = 0
for a in li_sort:
    if a >= k:
        ans +=1
print(ans)

Solution (Python):
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)

Solution (Python):



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


res = sum([hi >= K for hi in h])


print(res)

Solution (Python):
n, k = map(int, input().split())
l = list(map(int, input().split()))
res = 0
for x in l:
    if x >= k:
        res += 1
print(res)

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

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))

count = 0
for i in range(n):
    if h[i] >= k:
        count += 1

print(count)

Solution (Python):
n, k = [int(_) for _ in input().split()]
h = [int(_) for _ in input().split()]

cnt = 0
for i in range(n):
    if h[i]>=k:
        cnt +=1
print(cnt)

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

Solution (Python):
import numpy as np
n,k = map(int,input().split())
h = np.array(list(map(int,input().split())))
print(sum(h >= k))

Solution (Python):
n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]

cnt = 0
for i in h:
  if i >= k:
    cnt += 1

print(cnt)

Solution (Python):
N_K = str(input())
H = str(input()).split(" ")

N = N_K.split(" ")[0]
K = N_K.split(" ")[1]

count = 0
for h in H:
    if int(K) <= int(h):
        count += 1

print(count)

Solution (Python):
n,k = map(int, input().split())
h_list = [int(i) for i in input().split()]
count = 0
for h in h_list:
    if h>=k:
        count += 1
print(count)

Solution (Python):
N, K = map(int, input().split())
talls = list(map(int, input().split()))

print(len([t for t in talls if t >= K]))

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

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

Solution (Python):
N, K = map(int, input().split())
h_i = list(map(int, input().split()))

count = 0

for i in h_i:
    if i >= K:
        count += 1

print(count)

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

h.sort()

left=-1
right=N

while left<right-1:
   i=(left+right)//2
   if h[i]>=K:
      right=i
   else:
      left=i

print(N-right)

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

Solution (Python):
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))

print(len(list(filter(lambda x: x >= k, A))))

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

Solution (Python):
n,k=map(int,input().split())
h=list(map(int,input().split()))

ans=sum(i>=k for i in h)
print(ans)

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

print(sum(x>=K for x in h))

Solution (Python):
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)

Solution (Python):
N,K = map(int, input().split())
*H, = map(int, input().split())

count = 0
for i in range(N):
    if H[i]>=K:
        count = count + 1
    
print(count)

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

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



if __name__ == '__main__':
	main()

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

cnt=0
for i in range(N):
    if h[i]>= K:
        cnt+=1

print(cnt)

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

Solution (Python):
N,K=map(int,input().split())
count = 0
for i in range(1,N+1):
    h = list(map(int,input().split()))
    for j in h:
        if j >= K:
            count += 1
        else: continue
    break
print(count)

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(N: int, K: int, h: "List[int]"):
    print(len(
        [i for i in h if i >= K]
    ))
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    h = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, h)

if __name__ == '__main__':
    main()

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

Solution (Python):
n,k = map(int,input().split())
l = list(map(int,input().split()))
count=0

for i in l:
  if i >= k:
    count+=1
    
print(count)

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

Solution (Python):
import sys
input = sys.stdin.readline
N,K = map(int,input().split())

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

ans=0

for x in h:
    if x>=K:
        ans+=1
print(ans)

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

Solution (Python):
import numpy as np


_, K = map(int, input().split())
H = np.array([inp for inp in map(int, input().split())])
print((H >= K).sum())

Solution (Python):
N, K = map(int, input().split())
H = [inp for inp in map(int, input().split())]

ret = 0
for h in H:
  if h >= K:
    ret += 1
    
print(ret)

Solution (Python):
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)

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

Solution (Python):
N,K = map(int,input().split())
A = list(map(int,input().split()))
count = 0
for i in A:
  if K <= i:
    count += 1
print(count)

Solution (Python):
N, K = map(int,input().split())
height = list(map(int,input().split()))
number = 0

for i in range(N):
  if height[i] >= K:
    number += 1

print(number)

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

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

h = list(filter(lambda x: x>=K, h))
print(len(h))

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res


N,K=LI()

print(len(list(filter(lambda x: x >= K, LI()))))

Solution (Python):
N, K = map(int, input().strip().split())
H = list(map(int, input().strip().split()))

c = 0

for h in H:
    if h >= K:
        c += 1

print(c)

Solution (Python):
N, K = map(int, input().split())
height = list(map(int, input().split()))
cnt = 0

for h in height:
    if h >= K:
        cnt += 1

print(cnt)

Solution (Python):
N, K = map(int, input().split())
list_h = list(map(int, input().split()))

count = 0
for i in list_h:
    if i >= K:
        count += 1

print(count)

Solution (Python):
N, K = map(int, input().split())
list_h = list(map(int, input().split()))

list_h.sort()
list_h.insert(0, 0)
list_h.append(500)

L, R = 0, N + 1
while R - L > 1:
    C = (L + R) // 2
    if list_h[C] >= K:
        R = C
    else:
        L = C

print(len(list_h[R:-1]))

Solution (Python):
s=input().split()
t=input().split()
lm=int(s[1])
nm=int(s[0])
a=0
for k in range(nm):
  if int(t[k])>=lm:
    a=a+1
print(a)

Solution (Python):

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

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

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

Solution (Python):
n, height = map(int,input().split())

h = list(map(int,input().split()))
c = 0

for i in h:
    if i >= height:
        c += 1
        
print(c)

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
tmp = 0

for i in range(n):

    if h[i] >= k:
        tmp += 1

print(tmp)

Solution (Python):
n, k = map(int, input().split())
friends = list(map(int, input().split()))

count = 0
for f in friends:
    if f >= k:
        count += 1

print(count)

Solution (Python):
import numpy as np
n,k = map(int,input().split())
h = list(map(int,input().split()))

h1 = np.array(h)
print(len(h1[h1>=k]))

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
s = 0

for i in range(0, n):
    if h[i] >= k:
        s = s + 1

print(s)

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

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

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

Solution (Python):
N, K = map(int,input().split())
li_h = list(map(int, input().split()))

print(sum(i>=K for i in li_h))

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

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

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

ans = 0
for i in range(len(h)):
    if h[i] >= K:
        ans += 1
print (ans)

Solution (Python):
n = list(map(int,input().split()))
h = list(map(int,input().split()))
cnt = 0

for i in range(n[0]):
    if n[1] <= h[i]:
        cnt += 1
print(cnt)

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
out = 0

for i in range(n):
  if h[i] >= k:
    out += 1
    
print(out)

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

Solution (Python):
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)

Solution (Python):
N,K=map(int, input().split())
heights=[int(i) for i in input().split()]
ans=0


for i in range(N):
    
    if heights[i] >= K:
        
        ans+=1
        
print(ans)

Solution (Python):
import sys

n, k = map(int, sys.stdin.readline().split())
h = list(map(int, sys.stdin.readline().split()))

ans = 0
for i in range(n):
    if h[i] >= k:
        ans += 1

print(ans)

Solution (Python):
from sys import stdin

n,k = [int(x) for x in stdin.readline().rstrip().split()]

arr = [int(x) for x in stdin.readline().rstrip().split()]


sum = 0
for h in arr:
    if h >= k:
        sum +=1


print(sum)

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

Solution (Python):
n, k = map(int, (input().split()))
h = [int(i) for i in input().split()]

print([v >= k for v in h].count(True))

Solution (Python):
n, k = map(int, input().split())
tall = list(map(int, input().split()))

count = 0

for i in tall:
  if i >= k:
    count += 1

print(count)

Solution (Python):
import sys

n,k = (int(x) for x in input().split())
h = list(map(int , input().split()))
f = 0

for i in range(n):
    if h[i] >= k :
        f+=1
        
print(f)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n,k=map(int,input().split())
    print(sum(h>=k for h in map(int,input().split())))
resolve()

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

Solution (Python):
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)

Solution (Python):
A, B = map(int, input().split())
L = list(map(int, input().split()))
ans = 0
for l in L:
  if (l >= B):
    ans+= 1
print(ans)

Solution (Python):
N, K = map(int, input().split())
h = [int(i) for i in input().split()]

ans = 0
for hi in h:
    ans += 1 if (hi >= K) else 0

print(ans)

Solution (Python):
N,K = list(map(int, input().split()))
H = list(map(int, input().split()))

ans = 0
for h in H:
  if h >= K:
    ans += 1
    
print(ans)

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

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

Solution (Python):
n,k=map(int,input().split())
l=list(map(int,input().split()))
s=0
for e in l:
    if e>=k:
        s+=1
print(s)

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

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

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

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

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

Solution (Python):
from bisect import bisect_left

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

print(N - bisect_left(H, K))

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

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

Solution (Python):
N, *D, = [list(map(int, s.split())) for s in open(0)]
D = D[0]
num = 0
for i in range(N[0]):
    if D[i] >= N[1]:
        num += 1
        
print(num)

Solution (Python):
n,k =map(int,input().split())
h =list(map(int,input().split()))
cnt = 0

for i in range(n):
  if (h[i]>=k):
    cnt += 1
print(cnt)

Solution (Python):
n,k = map(int,input().split())

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

count = 0
for i in range(n):
    if h[i] >= k:
        count += 1

print(count)

Solution (Python):
n,k=(int(x) for x in input().split())
h=[int(x) for x in input().split()]

count=0
for i in h:
	if i>=k:
		count+=1

print(count)

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

ans = 0

for i in range(N):
    if h[i] >= K:
        ans = ans + 1

print(ans)

Solution (Python):
N, K = map(int, input().split())
H = list(map(int, input().split()))

print(sum([h >= K for h in H]))

Solution (Python):
N, K = map(int, input().split())
H = list(map(int, input().split()))

print(sum([h >= K for h in H]))

Solution (Python):
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)

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

Solution (Python):
N, K = map(int, input().split())
cnt = 0

for h_i in map(int, input().split()):
    if h_i >= K:
        cnt += 1

print(cnt)

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))
print(len(list(filter(lambda x: x >= k, h))))

Solution (Python):
n, k = map(int, input().split())
l = list(map(int, input().split()))
count = 0

for i in l:
    if i >= k:
        count += 1

print(count)

Solution (Python):



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

print(len([i for i in H if i >= K]))

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

Solution (Python):
N,K=map(int, input().split())

height=[int(x) for x in input().split()]

count=0

for h in height:
    if h>=K:
        count+=1

print(count)

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

Solution (Python):
n, k = map(int, input().split())
h = list(map(int, input().split()))

cnt = 0

for i in h:
    if i >= k:
        cnt += 1

print(cnt)

Solution (Python):
n,k=map(int,input().split())
A=list(map(int,input().split()))
c=0
for i in range(len(A)):
    if A[i]>=k:
        c+=1
print(c)

Solution (Python):
N,K=map(int,input().split())
S=list(map(int,input().split()))
count=0

for i in range(N):
	if S[i]>=K:count+=1
	else:count+=0
print(count)

Solution (Python):
N, K = map(int, input().split())
h_list = map(int, input().split())
h = [i for i in h_list]

count = 0
for i in range(len(h)):
    if h[i] >= K:
        count = count + 1

print(count)

Solution (Python):

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

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

Solution (Python):
N, K = map(int,input().split())
S = input().split()
cnt = 0
for s in S:
	if int(s) >= K:
		cnt += 1
print(cnt)

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    _, k = map(int, input().split())
    print(len([None for i in input().split() if int(i) >= k]))

if __name__ == '__main__':
    main()

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

cnt = 0

for i in range(N):
    if h[i] >= K:
        cnt += 1

print(cnt)

Solution (Python):
import sys

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

Solution (Python):
N, K = input().split()
N = int(N)
K = int(K)
heights = input().split()

result = 0
for i in range(N):
  h = int(heights[i])
  if h >= K:
    result += 1

print(result)

Solution (Python):
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)

Solution (Python):
n,k=map(int,input().split())
l=list(map(int,input().split()))
ans=0
for x in l:
  if x>=k:
    ans+=1
print(ans)

Solution (Python):
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)

Solution (Python):

import sys


def solve(N: int, K: int, h: "List[int]"):
    ans = 0
    for n in h:
        if K <= n:
            ans += 1
    print(ans)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    h = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, h)

if __name__ == '__main__':
    main()

Solution (Python):
n, k = map(int, input().split())
talls = list(map(int, input().split()))
num = 0
for tall in talls:
  if tall >= k:
    num += 1
print(num)

Solution (Python):
_, K = map(int, input().split())
tall = map(int, input().split())


print(len(list(filter(lambda x: x>=K, tall))))

Solution (Python):
n,k = map(int,input().split())
h = [int(i) for i in input().split()]

ans = 0 
for i in h:
    if i >= k:
        ans += 1
print(ans)

Solution (Python):
N, K = input().split()
n = int(N)
k = int(K)
h = [int(i) for i in input().split()]
ninzu = 0
for i in range(n):
  if h[i] >= k:
    ninzu = ninzu + 1 
print(ninzu)

Solution (Python):
_, K = [int(i) for i in input().split()]
ans = len([int(i) for i in input().split() if int(i) >= K])
print(ans)

Solution (Python):
from itertools import *

N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
count = 0

for i in range(N):
    if H[i] >= K:
        count += 1

print(count)

Solution (Python):
N_K = input()
N , K = N_K.split(" ")
N = int(N)
K = int(K)
H = input()
H = H.split(" ")
H = map(lambda x: int(x), H)
i=0
for hi in H:
    if hi>=K:
        i = i +1
print(i)

Solution (Python):
N, K = map(int, input().split())
H = list(map(int, input().split()))

count = 0
for i in H:
    if K <= i:
        count += 1

print(count)

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

Solution (Python):
n, k = [int(s) for s in input().split()]
hs = [int(s) for s in input().split()]

ret = 0
for h in hs:
  if h >= k:
    ret += 1

print(ret)

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

Solution (Python):
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)