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):
N, K = [int(x) for x in input().split()]
l = [int(x) for x in 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())
h = sorted(list(map(int, input().split())))
for i in range(n):
    if h[i] >= k:
        print(n - i)
        break
else:
    print(0)

Solution (Python):

from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():

    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)




main()

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

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

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

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

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

print(c)

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

Solution (Python):


def main():
    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)
if __name__ == '__main__':
    main()

Solution (Python):
def main():
    N,H = map(int,input().split())
    a = list(map(int,input().split()))
    count = 0
    for i in a:
        if i >= H:
            count += 1

    print(count)

if __name__ == "__main__":
    main()

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

Solution (Python):
NK = input().split()
hs = input().split()
ans = 0
for i in range(0, int(NK[0])):
    if int(hs[i]) >= int(NK[1]):
        ans += 1

print(ans)

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

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

import sys


def solve(N: int, K: int, h: "List[int]"):
    counter = 0
    for hh in h:
        if hh >= K:
            counter += 1
    print(counter)
    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):
get = list(map(int, input().split()))
N = get[0]
K = get[1]
h = list(map(int, input().split()))
ans = 0
for i in h:
    if i >= K:
        ans += 1
print(ans)

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

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

Solution (Python):
import copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

def LI(): return list(map(int, sys.stdin.readline().split()))

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

Solution (Python):



def solve():
    N, K, *hl = map(int, open(0).read().split())
    ans = 0
    
    for i in hl:
        if i >= K:
            ans += 1
    
    print(ans)


if __name__ == '__main__':
    solve()

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

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

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

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

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

count = 0

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

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

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


		
def main():
	n, k = map(int, input().split())
	al=list(map(int, input().split()))
	ans=len([v for v in al if v >= k])
	print(ans)

	

isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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

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

print(rider)

Solution (Python):
n,k = map(int, input().split())
H = sorted(list(map(int, input().split())), reverse = True)

ans = 0
for h in H:
    if h >= k:
        ans += 1
    else:
        break

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=[int(i) for i in input().split()]
a = [int(i) for i in input().split()]
ct=0
for i in a:
    if(i>=k):
        ct+=1
print(ct)

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

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

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

for e in a:
  if e-k >= 0:
    cnt += 1
    
print(cnt)

Solution (Python):
n, k = map(int, input().split())
L = [int(i) for i in input().split()]
L.sort(reverse=True)

flag = False
for i in range(len(L)):
  if L[i] >= k:
    continue
  else:
    print(i)
    flag = True
    break
if flag == False:
  print(n)

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

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

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

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

Solution (Python):


def main():
    N, K = map(int,input().split())
    h = list(map(int,input().split()))
    count = sum(1 if hi >= K else 0 for hi in h)
    print(count)


if __name__ == "__main__":
    main()

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
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


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


if __name__ == '__main__':
    main()

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

Solution (Python):

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

ans = 0
N = A[0]

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

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

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

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

Solution (Python):


if __name__ == "__main__":
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    print(len(list(filter(lambda x: x >= k, arr))))

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

Solution (Python):
_n, _k = map(int, input().split())
_members = list(map(int, input().split()))

_count = 0
for _member in _members:
  if _member >= _k:
    _count = _count + 1
print(_count)

Solution (Python):
import bisect

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

h.sort()
print(n-bisect.bisect_left(h,k))

Solution (Python):

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


h1 = [i-K for i in h]
h2 = [i for i in h1 if  i >= 0]
print(len(h2))

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

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

count = 0
for person in h:
    if person >= K:
        count += 1

print(count)

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

print(ans)

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

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

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

h.sort()
c= 0
for i, hi in enumerate(h):
    if hi>=K:
        c=N-i
        break
print(c)

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

input1 = input().split(" ")
h = input().split(" ")

N = int(input1[0])
K = int(input1[1])

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

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

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

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

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

  print(enough)


if __name__ == '__main__':
  main()

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
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())
a_list = list(map(int, input().split()))
count = 0
for a in a_list:
  if a >= 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):
get = list(map(int, input().split()))
N = get[0]
K = get[1]
h_i = list(map(int, input().split()))
sum = 0

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

print(sum)

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

res = 0
for hi in H:
  if hi >= K:
    res += 1

print(res)

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

for i in H:
    if(i >= K):
        ans += 1

print(ans)

Solution (Python):

n,k=map(int,raw_input().split())
h=map(int,raw_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()))

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

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

Solution (Python):
def func(N, K, h_i):
    count = 0
    for i in range(N):
        if h_i[i] >= K:
            count += 1
    return count

N, K = map(int, input().split(" "))
h_i = list(map(int, input().split(" ")))
print(func(N, K, h_i))

Solution (Python):
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string


import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def StoI():
    return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7



show_flg=False
show_flg=True


n,k=MI()
a=LI()
ans=sum([1 for i in a if i>=k])
for i in range(n):
    0
    
print(ans)

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

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

print(r)

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


if __name__ == "__main__":
    resolve()

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

l = [i for i in h if i >= K]

print(len(l))

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

Solution (Python):
a, b = map(int, input().split())
x = filter(lambda z: z>= b, map(int, input().split()))
print(len(list(x)))

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 math import *

def next_int():
    return int(input())

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

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

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

n = 0
for h_i in h:
  if h_i >= K:
    n += 1

print(n)

Solution (Python):
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
print(sum([1 for one in H if one>=K]))

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

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

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


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

print(count)

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

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

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

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

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




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

print(count)

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

Solution (Python):
a,b = map(int,input().split(" "))
ar = list(map(int,input().split(" ")))
count = 0
for r in ar:
    if r >= b:
        count += 1
print(count)

Solution (Python):
def main():
    N, K = map(int, input().split())
    lst_h = list(map(int, input().split()))
    ans = sum(h >= K for h in lst_h)
    print(ans)


if __name__ == "__main__":
    main()

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):
if __name__ == "__main__":
    num,limit=map(int,input().split())
    list = input().split()
    tmp = int()
    for i in list:
        if int(i)>=limit:
            tmp += 1
    print(tmp)

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

Solution (Python):
N, K, *h = map(int, open(0).read().split())
print(len([1 for i in h if K <= i]))

Solution (Python):
N, K, *h = map(int, open(0).read().split())
print(sum([1 for i in h if K <= i]))

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

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

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

    ans = 0

    for target in targets:
        if (target >= K):
            ans += 1
    print(ans)
resolve()

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    [N, K] = string_to_int(inputs[0])
    heights = string_to_int(inputs[1])
    return len(list(filter(lambda x: x >= K, heights)))


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(2))
    print(ret)

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

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

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

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 = list(int(i) for i in input().split())
cnt = 0
for i in h_list:
    if i >= k:
        cnt += 1
print(cnt)

Solution (Python):

count=0
n,k=map(int,input().split())
H=list(map(int,input().split()))
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 = sorted(map(int, input().split()))

num = 0
for i, _h in enumerate(h):
    if _h >= K:
        num = N - i
        break

print(num)

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

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

print(c)

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

ans = 0
member = list(map(int, input().split()))

for i in member:
    if i >= k:
        ans += 1

print(ans)

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

Solution (Python):

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

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

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

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

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

Solution (Python):
number_of_people, required_height = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]


def counter(heights):
    res = 0
    def inner():
        nonlocal res
        for i in heights:
            if i >= required_height:
                res += 1
        return res
    return inner


solve = counter(heights)

print(solve())

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

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

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

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

Solution (Python):
def nibutanlt(n,list_a,start_index):
    if list_a[0] >= n:
        return(start_index - 1)
    elif list_a[-1] < n:
        return(len(list_a)+start_index - 1)
    temp = len(list_a)//2
    if list_a[temp] < n:
        return(nibutanlt(n,list_a[temp:],temp + start_index))
    else:
        return(nibutanlt(n,list_a[0:temp],start_index))


n,k = map(int,input().split())
h_list = list(map(int,input().split()))
ans = 0
h_list.sort()
ans = nibutanlt(k,h_list,0) + 1
print(n - ans)

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20

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

Solution (Python):
tmp = input().split()
K = int(tmp[1])
hs = input().split()
c = 0
for hi in hs:
	if int(hi) >= K:
		c += 1
print(c)

Solution (Python):
N, K = map(int,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):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



N,K = II()
h = III()

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

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


import math
import os
import sys


DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def main():
    N, K = [int(e) for e in inp().split()]
    H = [int(e) for e in inp().split()]
    print(len([h for h in H if h >= K]))


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):

def main():
    N, K, *H = map(int, open(0).read().split())
    ans = sum(i >= K for i in H)
    print(ans)


if __name__ == "__main__":
    main()

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 = input().split(" ")

sum = 0
for i in h:
    if k <= int(i):
        sum+=1
print(sum)

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

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

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

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

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

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

print(len(tuple(filter(lambda x: x >= k, h))))

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

for i in range(N):
    if K<=h[i]:
        flag+=1
        
print(flag)

Solution (Python):
from collections import Counter
mod = 1000000007


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


def update(x, y, new_value, dp):
    if 0 <= x < len(dp) and 0 <= y < len(dp):
        dp[x][y] = min(dp[x][y], new_value)

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

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

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

print(sum([1 for item in h if item >= 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())
h = [int(i) for i in input().split()]

ans = sum(1 for x in h if x >= k)

print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


def main():
    n, k = map(int, input().split())
    hl = list(map(int, input().split()))
    print(len(list(filter(lambda h: h >= k, hl))))


if __name__ == '__main__':
    main()

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

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


def main():
    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)


if __name__ == '__main__':
    main()

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

Solution (Python):
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n,k = MAP()
h = MAP()
ans=0

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

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

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