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):
a,b=map(int,input().split())
i=list(map(int,input().split()))
j=[x for x in i if x>=b]
print(len(j))

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

ans = sum(y >= K for y in h)
print(ans)

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

Solution (Python):
n, k = 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())

lis = []
count = 0

lis = list(map(int,input().split()))
  
for height in lis:
  if height >= K:
    count += 1
    
print(count)

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, r = map(int, input().split())
l = list(map(int, input().split()))
mem = 0
for i in range(len(l)):
    h = l[i]
    if h >= r:
        mem += 1
print(mem)

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):
from collections import deque

n, k = map(int, input().split())
h = deque(list(input().split()))
ans = 0

while len(h) > 0:
    if int(h.pop()) >= k:
        ans += 1
        
print(ans)

Solution (Python):
n, k = map(int, input().split())
h = [int(x) for x in 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 = list(input().split())
ans = 0

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

print(ans)

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

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

Solution (Python):

a = input()
b = input()


N =  int(a.split()[0])
K = int(a.split()[1])
h = [int(x) for x in b.split()]

available_num = 0
for hight in h:
    if hight >= K:
        available_num += 1

print(available_num)

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

Solution (Python):



def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    h = sorted(h, reverse=True)

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


if __name__ == '__main__':
    main()

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

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

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

answer = sum(x >= k for x in h)

print(answer)

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

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

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

print(sum([1 for i in h if i >= K]))

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

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

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

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

h.sort()
h.reverse()
count = 0
for i in h:
  if i >= K:
    count += 1
  else:
    break;
print(count)

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

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

cnt = 0
for x in input().split():
  if int(x)>=K:
    cnt += 1

print(cnt)

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

ans=0
i=0
H = [int(x) for x in input().split()]
for i in (H):
    if i>=K:
        ans =ans+1
    
print(ans)

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

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

Solution (Python):
import sys
n, k = map(int, sys.stdin.readline().split())
h = list(map(int, sys.stdin.readline().split()))
s = 0
for i in h:
  if i >= k:
    s+=1
print(s)

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

counter =0
for l_num in l:
    if l_num >= k:
        counter += 1
print(counter)

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()))
num = 0
for i in h:
    if k <= i:
        num += 1
    else:
        continue
print(num)

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

Solution (Python):
if __name__ == '__main__':

	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())
print(sum(list(map(lambda x:int(x)>=k,input().split()))))

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())
hl=list(map(int,input().split()))
count=0
for h in hl:
  if h >= k :
    count+=1

print(count)

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

Solution (Python):
from sys import stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
H = [int(_) for _ in stdin.readline().rstrip().split()]
ans = 0
for h in H:
    if h >= K:
        ans += 1
print(ans)

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



def main():


    n,k = map(int,input().split())
    heigtList = map(int,input().split())
    count = 0

    for i in heigtList:
        if k <= i :
            count += 1
    print(count)



if __name__ == "__main__":
    main()

Solution (Python):
N,K = list(map(int,input().split()))[:2]
height = list(map(int,input().split()))[:N]
able2ride = [a for a in height if a >= K]
print(len(able2ride))

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

Solution (Python):
N, K = list(map(int, input().split(" ")))
h = sorted(list(map(int, input().split(" "))))
print(sum([0 if i<K else 1 for i 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,limit = map(int, input().split())
height_list = list(map(int, input().split()))

cnt=0
for height in height_list:
    if(limit<=height):
        cnt+=1
print(cnt)

Solution (Python):
N, K = map(int, input().split())
h = map(int, input().split())
ans = 0
for i in h:
  if K <= 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())
l = list(map(int, input().split()))
l.sort()

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

print(N - cnt)

Solution (Python):



def main():
    N, K = map(int, input().split())
    heights = list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

Solution (Python):


n, k = map(int, input().split())
height = [int(s) for s in input().split()]

cnt = 0
for i in height:
    if i >= k:
        cnt += 1
        
print(cnt)

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

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

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

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

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

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

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

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

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

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

for height in list:
    if height>=K:
        i+=1

print(i)

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

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):
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
i=0
while h[i]<k:
    i+=1
    if i==n:
        break
print(n-i)

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

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

print(oppai)

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

Solution (Python):
n,k=map(int,input().split())
arr=list(map(int,input().split()))
ans=0
for i in range(n):
  if arr[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):
n,k = (int(x) for x in 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 collections
N, K = map(int, input().split())
h = list(map(int, input().split()))
assert( len(h) == N)
s = collections.Counter([hi >= K for hi in h])
print(s[True])

Solution (Python):
from sys import stdin

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

print(sum([1 for h in stdin.readline().rstrip().split() if int(h) >= k]))

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

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

print(num)

Solution (Python):

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






OK_h_list = [h_list[i] for i in range(N) if h_list[i]>=K]
print(len(OK_h_list))

Solution (Python):

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

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

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

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

Solution (Python):
n, k = map(int, raw_input().strip().split())
h = map(int, raw_input().strip().split())

ans = 0
for num in h:
    if num >= k: ans += 1

print ans

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


def can_ride(n):
    return n >= K


print(len(list(filter(can_ride, heights))))

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

Solution (Python):
import heapq

def minus(x):
    y = int(x)
    return y*(-1)

N , K = map(int,input().split())
h_list = list(map(minus,input().split()))
ans = 0
heapq.heapify(h_list)

for i in range(N):
    if (heapq.heappop(h_list)*(-1) < K):
        break

    else:
        ans += 1


print(ans)

Solution (Python):
import heapq

N , K = map(int,input().split())
h_list = list(map(int,input().split()))
ans = 0
heap = []

for i in range(N):
    heapq.heappush(heap, h_list[i]*(-1))

for i in range(N):
    if (heapq.heappop(heap)*(-1) < K):
        break

    else:
        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):
n, k = map(int, input().split())
h = [1 if int(i)>=k else 0 for i in input().split(" ")]
print(sum(h))

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 = map(int, input().split())
h = [int(_) for _ in input().split()]
res = 0
for i in h:
    if i >= K:
        res += 1

print(res)

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

Solution (Python):

friend_num, required_height = map(int, input().split())
heights = list(map(int, input().split()))
passed_num = 0
for i in heights:
  if i >= required_height:
    passed_num += 1
print(passed_num)

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

T = 0
i = 0
while T == 0:
  if H[i] >= K:
    T = 1
  else:
    i += 1
    if i >= N:
      print(0)
      quit()
      
print(N - i)

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

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

print(ans)

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

L.sort()
for i in range(n):
      if L[i]>=k:
            print(n-i)
            exit()
print(0)

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

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

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

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

res = 0
for j in member_lst:
    if j >= k:
        res += 1
print(str(res))

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 = list(map(int,input().split()))
H = list(map(int,input().split()))
print(sum([1 for h in H if K<=h]))

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

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

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

Solution (Python):
N, K = map(int, input().split())
h = 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()))



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()))
count=0


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

print(count)

Solution (Python):
n, k = map(int, input().split())
h = map(int, input().split())
n_can_ride = sum(1 for hi in h if k <= hi)
print(n_can_ride)

Solution (Python):



person, limit_height = input().strip().split()
person = int(person)
limit_height = int(limit_height)


i = 0
can = 0
person_height = list(map(int, input().split()))

for i in person_height:
    if i >= limit_height:
        can += 1

print(can)

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

ans = 0

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

Solution (Python):
from sys import stdin

N, K = map(int, stdin.readline().rstrip().split())
h = list(map(int, stdin.readline().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()))
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()))
from bisect import bisect_left
print(n - bisect_left(sorted(h),k))

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

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

Solution (Python):





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

ret = 0
for h in Hn:
  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 k <= i:
        count += 1
print(count)

Solution (Python):





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

Solution (Python):
def calculate(people_num, limit, height_array):
    permission = [height for height in height_array if height >= limit]
    return len(permission)
 
if __name__ == "__main__":
    people_num, limit = map(int, input().split())
    height_array = map(int, input().split())
    result_num = calculate(people_num, limit, height_array)
    print(result_num)

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())
li = list(map(int, input().split()))
print(len([i for i in li if i >= K]))

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

H = [ i for i in h if i>=k ]

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

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

nvalid = sum(1 for h in H if h >= K)
print(nvalid)

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

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

print(res)

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

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

print(ans)

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

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

print(count)

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

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

print(ok)

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

print(b)

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

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

h.sort()

ans = 0

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

print(ans)

Solution (Python):
n, k = list(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 range(n):
    if h[i]>=k:
        ans+=1
print(ans)

Solution (Python):
import os

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

ans = 0

for h in hlist:
    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 h:
    if i >= k:
        cnt += 1
print(cnt)

Solution (Python):
d, e = map(int, input().strip().split())
g = list(map(int, input().strip().split()))


total = 0
for i in g:
    if i >= e:
        total += 1
print(total)

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

Solution (Python):
def solve(string):
    n, k, *h = map(int, string.split())
    return str(len([_h for _h in h if _h >= k]))


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

Solution (Python):


MOD = 10 ** 9 + 7

n, k = map(int, input().split())
hn = list(map(int, input().split()))

ans = sum(map(lambda x: x >= k, hn))

print(ans)

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 = list(int(x)>=k for x in input().split())
ans = 0
for i in range(n):
    if 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 h:
    if i >=K:
        count +=1
print(count)

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

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

print ans

Solution (Python):
NK = input().split()
N = int(NK[0])
K = int(NK[1])
h_list = [int(h) for h in input().split()]
able_number = 0
for h in h_list:
    if h >= K:
        able_number += 1
print(able_number)

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

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

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

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

Solution (Python):
X=[int(i) for i in input().split()]
Y=[int(i) for i in input().split()]
count=0
for y in Y:
  if y>=X[1]:
    count+=1
print(count)

Solution (Python):
X=[int(i) for i in input().split()]
Y=[int(i) for i in input().split()]
count=0
for y in Y:
  if y>=X[1]:
    count+=1
  else:
    pass
print(count)

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

counter = 0

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

print(counter)

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

print(len([h for h in li_h if h >= k]))

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

h.sort()
c=0
for i in range(n):
  if h[i]<k:
    c+=1
  else:
    print(n-c)
    break
if c==n:
  print(0)

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

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

Solution (Python):

n,k = map(int,input().split(" "))


d = list(map(int,input().split(" ")))

res = 0
for i in range (0,n) :
    if d[i]>=k : res += 1
print(res)

Solution (Python):
def main():

    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)

if __name__ == "__main__":
    main()

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

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):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N,K = inpl()
print(sum([1 if h >= K else 0 for h in inpl()]))

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()))
d = 0
for i in range(n):
  if h[i] >= k:
    d += 1

print(d)

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

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

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

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

print(len)

Solution (Python):
N , K = map(int,input().split())
H = list(map(int,input().split()))
 
count = 0
for h in H:
  if h >= 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 += 1
print(ans)

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

a = [int(x) for x in input().split()]
ans = 0
for x in a:
    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
import bisect

def input():
    return sys.stdin.readline().rstrip('\n')

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

H.sort()
i = bisect.bisect_left(H, K)

print(N-i)

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

Solution (Python):
def solve():
    N, K = list(map(int, input().split()))
    n = list(map(int, input().split()))

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

    print(str(count))

solve()

Solution (Python):
def solve(n, k, h):
    return len(list(filter(lambda _: _ >= k, h)))

n, k = map(int, input().split())
h = list(map(int, input().split()))
print(solve(n, k, h))

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

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

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

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n,k = inpl()
h = inpl()
res = 0
for i in h:
    if i >= k:
        res += 1
print(res)

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, *h, = map(int, open(0).read().split())
ans = 0
for i in h:
  if K <= i:
    ans += 1
print(ans)