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):
import sys
a,b = input().split()
c = input().split()
cnt = 0
for i in range(len(c)):
    if int(c[i]) >= int(b):
        cnt += 1
print(cnt)

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

member.sort(reverse=True)

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

print(count)

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

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

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

Solution (Python):
from sys import stdin

input = stdin.readline
mi = lambda: map(int, input().split())
lmi = lambda: list(mi())
si = lambda: input().strip('\n')
ii = lambda: int(input())

n, k = mi()
cnt = 0
arr=lmi()
for i in arr:
    if i >= k:
        cnt+=1
print(cnt)

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

passengers = 0

for i in t:
  if int(i) >= K:
    passengers += 1

print(passengers)

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(sum([h>=K for h in H]))

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 >= 0:
        cnt += 1
print(cnt)

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

Solution (Python):
N, K = list(map(int, input().split(" ")))
h = sorted(list(map(int, input().split(" "))))
h_ = sorted(set(h))
n = len(h_)
while n > 1:
    if h_[n//2] == K:
        print(len(h)-h.index(h_[n//2]))
        break
        
    elif h_[n//2] >= K:
        h_ = h_[:n//2]
    else:
        h_ = h_[n//2:]
    n = len(h_)
 
if n==1:
    if h_[0] < K: print(h[::-1].index(h_[0]))
    else: print(len(h)-h.index(h_[0]))

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

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 = list(map(int, input().split()))
H = list(map(int, input().split()))
result = 0
for i in range(N[0]):
  if (H[i] >= N[1]):
    result += 1
print(result)

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

N = A[0]
K = A[1]

a = N-1
b = 0
d = 0
for i in B:
  c = B[b]
  if K <= c:
    d = d+1
  b = b+1
print(d)

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

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

Solution (Python):


N, K = input().split()
h_list = input().split()
count = 0
K = int(K)
for h in h_list:
    if(int(h) >= K):
        count += 1

print(count)

Solution (Python):
n,k = list(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):
NK = input().split()
N = int(NK[0])
K = int(NK[1])
h = list(map(int, input().split()))
i = 0
for j in range(N):
    if h[i] < K:
        h.pop(i)
    else:
        i = i + 1
print(len(h))

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

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

for i in S:
  if(i>=K):
    count += 1
print(count)

Solution (Python):
sum = 0
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
  if M <= A[i]:
    sum += 1
print(sum)

Solution (Python):
if __name__ == '__main__':
    n, k = map(int, input().split())
    heights = list(map(int, input().split()))
    heights.sort()
    
    index = 0
    while len(heights) > index and heights[index] < k:
        index += 1
        if n == 1:
            break
    print(n - index)

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

counter = 0
for i in A:
  if i >= K:
    counter += 1
      
print(counter)

Solution (Python):
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    over_friends = 0

    for i in range(friends):
        if sorted_heights[i] < min_height:
            continue
        else:
            over_friends = friends - i
            break
    
    print(over_friends)

if __name__ == '__main__':
    main()

Solution (Python):

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

s = 0 
for hi in h:
    if hi >= k:
        s += 1
print(s)

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

Solution (Python):
import numpy as np
num, min_height = map(int, input().split(" "))
each_height = np.array(list(map(int, input().split(" "))))

print(len(each_height[each_height >= min_height]))

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

counter = 0
for i in h:
    if i >= K :
        counter += 1

print(counter)

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

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

print(answer)

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

print(count)

Solution (Python):
N,K = list(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()))
a = 0

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

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

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

Solution (Python):



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

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

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

for i in range(len(height)):
    if height[i] >= k:
        count += 1
    
print(count)

Solution (Python):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = int(l[1])

    h = [int(x) for x in input().strip().split(" ", n)]

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

    print(count)


if __name__ == "__main__":
    main()

Solution (Python):
s = raw_input().split()
[N, K] = s
N = int(N)
K = int(K)


s = raw_input().split()

h = [0]*N

for i in range(N):
    h[i] = int(s[i])
    

h.sort(reverse=True)


for i in range(N):
    if (h[i] >= K):
        continue
    else:
        print i
        exit()

print N

Solution (Python):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = int(l[1])

    h = input().strip().split(" ", n)

    count = 0
    for x in h:
        x = int(x)
        if x >= k:
            count += 1

    print(count)


if __name__ == "__main__":
    main()

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

Solution (Python):
def solve():
    N,K = map(int, input().split())
    h = [1 if i >= K else 0 for i in map(int, input().split())]
    return sum(h)

if __name__ == '__main__':
    print(solve())

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

print(cnt)

Solution (Python):
from sys import stdin

lines = stdin.readlines()
 
N, K = map(int, lines[0].split())
H = list(lines[1].split())

cnt = int()
cnt = 0

for h in H :
  if bool( int(h) >= K ) :
    cnt += 1
  else:
    cnt += 0

print(cnt)

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

H = input().split(' ')
H = [int(x) for x in H if int(x) >= K]
print(len(H))

Solution (Python):

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

H = [int(h) for h in input().split()]

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

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

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

ans = 0
for x in frei:
    if x >= k:
        ans += 1
print(ans)

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

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

print(ans)

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

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

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

print(count)

Solution (Python):
n, k = map(int, input().split())
h = [int(i) for i 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 = map(int, input().split(" "))
ans = 0
for p in h:
    if p >= k: ans += 1
print(ans)

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

Solution (Python):


N, K = map(int, input().split())
h_list = list(map(int, input().split()))
count = sum(h>=K for h in h_list)
print('{}'.format(count))

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

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

Solution (Python):
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
print(sum([1 if K<=a else 0 for a in A]))

Solution (Python):
n,k=list(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=map(int,input().split())
h=input().split()
a=0
for i in h:
  if int(i)>=k:
    a+=1
print(a)

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())
arr = list(map(int, input().split()))
arr.sort()
cnt = 0

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

Solution (Python):
n,k=[int(x) for x in input().split()]
H=[int(x) for x in input().split()]
for h in H:
  if h<k:
    n-=1
print(n)

Solution (Python):
n, k = (int(x) for x in input().split())
tall_list = list(map(int, input().split()))
member = 0
for i in tall_list :
	if k <= i :
		member += 1
	else :
		pass
	
print(member)

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())
listA = list(map(int, input().split()))

c = 0

for i in listA:
  if i >= K:
    c += 1
print(str(c))

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

count = 0
for i in range(N):
	if(friends[i] >= K):
		count = N-i
		break

print(count)

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

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

count=0
for item in l:
    if item>=K:
        count+=1
    
print(count)

Solution (Python):
a=input().split(' ')
b=int(a[0])
c=int(a[1])
data=input().split(' ')
data_1=0
data_2=0
for i in range(b):
	data_1=int(data[i])
	if data_1 >= c:
		data_2=data_2+1
	else:
		pass
print(data_2)

Solution (Python):
[N, K] = list(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)

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


print(len(H_hi))

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

Solution (Python):
s=list(map(int,input().split()))
t=list(map(int,input().split()))
a=0
for i in range(s[0]):
  if s[1]<=t[i]:
    a+=1
print(a)

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()))
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(N)

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
  else:
    count += 0

print(count)

Solution (Python):
def B_RollerCoaster():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    ans = len([h[x] for x in range(N) if K <= h[x] ])
    print(ans)
    
if __name__ == "__main__":
    B_RollerCoaster()

Solution (Python):
if __name__ == '__main__':
    N, K = map(int, input().split())
    people_hight = list(input().split())
    ok = 0

    for person_hight in people_hight:
        if K <= int(person_hight) :
            ok = ok + 1
    print(ok)

Solution (Python):
A=list(map(int,input().split()))
B=list(map(int,input().split()))
count=0
for b in B:
    if A[1]<=b:
        count+=1
print(count)

Solution (Python):
import numpy as np
result = 0
N = list(map(int, input().split())) 
A = list(map(int, input().split())) 

for i in range(N[0]):
    p1 = A[i]
    if p1 >= N[1]:
        result +=1
print(result)

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

Solution (Python):
n,k=[int(i) for i in input().split()]
p = list(map(int,input().split()))
import numpy as np
p=np.array(p)
D=p-k
print(np.count_nonzero(D>=0))

Solution (Python):



x = input().split()

x1 = int(x[0])
x2 = int(x[1])

y = input().split()

count = 0
for n in y:
    if int(n) >= x2:
        count += 1

print(count)

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

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

Solution (Python):
import numpy as np

n, k = map(int, input().split())
h = list(map(int, input().split()))
a = np.array(h)
print(np.sum(a >= k))

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

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())
L = list(map(int,input().split()))
count = 0
for i in range(N):
    if L[i] >= K:
        count += 1
print(count)

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

h.sort(reverse=True)
flag = True
if h[n-1]>k:
	ans = n
	flag = False
elif h[0] < k:
	ans = 0
	flag = False

elif h[n-1]==k:
	ans = n
elif h[0]==k:
	ans = h.count(h[0])
if flag == True:
	for i in range(0,n):
		if h[i] < k:
			ans = len(h[0:i])
			break

print(ans)

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

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

Solution (Python):

N, K = input().split()
N = int(N)
K = int(K)
a = input().split()
ans = 0

ans = sum(1 for x in a if int(x) >= K)
		
print(ans)

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

count = 0
for h in h_list:
    if h >= K:
        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):
import numpy as np

a = list(map(int, input().split()))
N = a[0]
K = a[1]

h = list(map(int, input().split()))
c = [1 if i>= K else 0 for i in h]
print(sum(c))

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

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

Solution (Python):
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 = count + 1
        
print(count)

Solution (Python):
def _input():
    array = input().split()
    
    return int(array[0]), int(array[1])

def input_heights():
    array = input().split()
    array_as_int = []

    for i in array:
        array_as_int.append(int(i))
    return array_as_int

def result(array, limit):
    counter = 0
    for i in array:
        if limit <= i:
            counter += 1
    return counter


if __name__ == "__main__":
    number, height = _input()
    heights_array = input_heights()
    print(result(heights_array, height))

Solution (Python):
data = raw_input().split()
n, size = int(data[0]), int(data[1])
data = raw_input().split()
res = 0
for i in data:
    if (int(i) >= size):
        res +=1

print(res)

Solution (Python):


def solve(arg: str) -> str:
    NK, H = arg.split('\n')
    n, k = map(int, NK.split())
    ar_H = map(int, H.split())
    return str(sum(k <= int(h) for h in ar_H))


if __name__ == "__main__":
    print(solve('\n'.join([input() for _ in range(2)])))

Solution (Python):
a=list(map(int,input().split()))
h = list(map(int,input().split()))
n = a[0]
k = a[1]
i=1
ans=0
while i <= n:
    if h[i-1] >= k:
        ans = ans+1
    i = i+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 K<=h[i]:
        cnt+=1
print(cnt)

Solution (Python):
a = list(map(int,input().split()))
N = a[0]
K = a[1]

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

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

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

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):

x = input()
hights_str = input()

low_limit = int(x.split(" ")[1])
hights = map(int, hights_str.split(" "))

count = 0
for hight in hights:
    if hight >= low_limit:
        count += 1

print(count)

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):
def F(x):
    global K
    if K <= x:
        return x
N,K=map(int,input().split())
H=list(map(int,input().split()))
H=list(filter(F,H))
print(len(H))

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

Solution (Python):
import numpy as np

_N, K = tuple(input().split(" "))
heights = np.array(
    input().split(" "),
    dtype=np.int64
)

print(
    len(heights[heights >= int(K)])
)

Solution (Python):
j = 0
a = 0
i = 0
N,K=(int(x) for x in input().split())
h = [int(x) for x in input().split()]
"""j = 0
a = 0
i = 0"""
for i in range(N):
    if h[i]>=K:
        a = a+1
print(a)

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

Solution (Python):

N, K = input().split()
h = input().split()

h_ok = [i for i in h if int(i) >= int(K)]

print(len(h_ok))

Solution (Python):
b,c = list(map(int,input().split()))
a = [int(a) for a in input().split()]
ans=0
for i in range (b):
  if c <= a[i]:
    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):
N, K = map(int, input().split())
hs = map(int, input().split())

r = 0
for h in hs:
    if h >= K:
        r += 1
print(r)

Solution (Python):
n, k = [int(x) for x in input().split(' ')]
friends = [int(x) for x in input().split(' ')]
count = 0
for friend in friends:
    if friend >= k:
        count += 1
print(count)

Solution (Python):

import numpy as np
import sys
sys.setrecursionlimit(100000)

directions = np.array([[1, 0], [0, 1], [-1, 0], [0, -1]])


def acinput():
    return list(map(int, input().split(" ")))


sys.setrecursionlimit(100000)


directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]
directions = list(map(np.array, directions))


def acinput():
    return list(map(int, input().split(" ")))


N, K = acinput()
h = np.array(acinput())

print(np.count_nonzero(h >= K))

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

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

for n in range(N):
    if h[n]>=K:
        count=count+1
    else:
         pass

print(count)

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

print(c)

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

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

res = 0
for h_i in h:
    if h_i >= k:
        res += 1

print(res)

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

print(np.sum(l>=h))

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

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

Solution (Python):
def main():

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


if __name__ == "__main__":
	main()

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

res = 0
for i in range(nk[0]):
    if(h[i] >= nk[1]):
        res += 1

print(res)

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

h = [int(i) for i in input().split()]

ans = 0

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

print('{}'.format(ans))

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
h.sort()
for i, l in enumerate(h):
    if l >= K:
        ans = len(h) - i
        break

print(ans)

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

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 = 0
h = list(map(int,input().split()))

for l in range(n):
    if h[l] >= k:
        a += 1
    else:
        a = a

print(a)

Solution (Python):
N, K = (int(x) for x in input().split())

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

ride_member = 0
for height in h:
  if height >= K:
    ride_member += 1
  else:
    ride_member += 0

print(ride_member)

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

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

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

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

print(count)

Solution (Python):
sin = input()
aa = list(map(int, sin.split()))
sin = input()
bb = list(map(int, sin.split()))

n = aa[0]
k = aa[1]

cc = list(map(lambda x: x >= k, bb))
print(cc.count(True))

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

h = input().split()

c = 0
for a in h:
    if int(a) >= k:
        c +=1

print(c)

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

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 = list(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 = [int(i) for i in input().split(" ")]

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

print(c)

Solution (Python):
import sys
input = sys.stdin.readline


n,k=(int(x) for x in input().split())


h = [int(i) for i in 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()))
s=0
for i in h:
  s+=1 if i >= K else 0
print(s)

Solution (Python):
rule = input().split()
men = input().split()

mens = 0
for i in men:
  if int(rule[1]) <= int(i):
    mens += 1

print(mens)

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

s = 0
for n,x in enumerate(l):
        if x>=b:s+=1
print(s)

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):
human_number, rest_high = map(int,input().split())
human = input()
human_list = human.split()
count = 0
for i in range(0,human_number):
    if int(human_list[i]) >= rest_high:
        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+=1
print(ans)

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

B = 0

for z in range(n):
    if int(a[z]) >= k:
        B += 1

print(B)

Solution (Python):

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

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

taller = [p for p in h if p >= K]
print(len(taller))

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

Solution (Python):
import numpy as np

N,K = [int(i) for i in input().split(" ")]

N = np.array([int(i) for i in input().split(" ")])

print(np.count_nonzero(N >= K))

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

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

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

print(count)

Solution (Python):
input1 = input()
hight_list = list(map(int, input().split()))
(person_num, hight_limit) = list(map(int, input1.split()))

cnt = 0
for i in hight_list:
  if i >= hight_limit:
    cnt = cnt + 1

print(cnt)

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

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

print(c)

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

print(len([i for i in b if i>=a[1]]))

Solution (Python):
import numpy as np
N, K = [int(i) for i in input().split()]
arr_h = np.array([int(i) for i in input().split()])
arr_judge = arr_h >= K
print(sum(arr_judge))

Solution (Python):
input_1 = input().split()
input_2 = input().split()
n = int(input_1[0])
k = int(input_1[1])
ans = 0
for i in range(n):
  if int(input_2[i]) >= k:
    ans += 1
print(ans)

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

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

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

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

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

if 1 <= N <= 10**5 and 1 <= K <= 500:
    pass
else:
    INPUT_1 = input()
    N, K = INPUT_1.split()
    N = int(N)
    K = int(K)

INPUT_2 = list(map(int, input().split()))
if len(INPUT_2) == N:
    pass
else:
    INPUT_2 = list(map(int, input().split()))

count = 0
for i in range(len(INPUT_2)):
    if INPUT_2[i] >= K:
        count += 1
    else:
        pass
print(count)

Solution (Python):
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
  else:
    ans += 0
print(ans)

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

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

print(count)

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

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)