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

print(cnt)

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

a = 0
for i in h:
    if 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 h:
    if i >= K:
        count += 1
print(count)

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

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

answer = 0

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

print(answer)

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

cnt = 0
for i in l:
    if i >= K:
        cnt = cnt + 1

print(cnt)

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

possible = []

for i in h:
    if i >= K:
        possible.append(i)

print(len(possible))

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

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

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

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

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

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):
import numpy as np

n,k=map(int,input().split())
h=np.array(list(map(int,input().split())))

print(np.count_nonzero(h-k>=0))

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

cnt = 0

for i in range(n):
    cnt += H[i] >= k

print(cnt)

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

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

print(o)

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

print(count)

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

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

ans = 0
for hi in i:
    if hi >= K:
        ans += 1
print(ans)

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




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

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

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

cnt = 0

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

Solution (Python):
N, K = map(int,input().split())
friend = list(map(int,input().split()))
clear = []

for i in friend:
    if i >= K:
        clear.append(i)

print(len(clear))

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

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

print(ans)

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

for i in lst:
    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):
total_people, min_height = map(int, input().split())
height = map(int, input().split())
rideable_people = 0
for i in height:
    if i >= min_height:
        rideable_people += 1
print(rideable_people)

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

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

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

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

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

cn = 0

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

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

Solution (Python):
mem_num, over_height = map(int, input().split())
members_hgt = list(map(int, input().split()))
cnt = 0

for i in members_hgt:
    if i >= over_height:
        cnt += 1

print(cnt)

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

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

def answer(n: int, k: int, h: list) -> int:
    ans = 0
    for i in range(0, n):
        if h[i] >= k:
            ans += 1
    return ans

print(answer(n, k, h))

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

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

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

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

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

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

data = list(map(int,input().split()))
cnt =0

for i in range(len(data)):
    if data[i]>= K:
        cnt += 1
print(cnt)

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





availability = 0

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

print(availability)

Solution (Python):



N, K = map(int, input().split())
my_list = list(map(int, input().split(maxsplit=N)))
answer = 0

for i in range(0, N):
    if my_list[i] >= K:
        answer += 1

print(answer)

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

ANS = sum(x >= K for x in H)
print(ANS)

Solution (Python):
def atc_142b(NK_input: str, hi_input: str) -> int:
    N, K = map(int, NK_input.split(" "))
    hi = [int(i) for i in hi_input.split(" ")]
    hi = sorted(hi)
    for i in range(0, len(hi)):
        if hi[i] >= K:
            return len(hi) - i
    return 0


NK_input_value = input()
hi_input_value = input()
print(atc_142b(NK_input_value, hi_input_value))

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

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

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

answer = sum(i >= K for i in h)

print(answer)

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

result = 0

for h in heights:
    if h >= K:
        result += 1
print(result)

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

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

print(count)

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

able_num = 0

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

Solution (Python):



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

ans = sum(x>=k for x in l)
print(ans)

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

count = 0
for height in heights:
    if k <= height:
        count = count + 1

print(count)

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

person = 0

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

print(person)

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

print(s)

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

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

print(len(h_l))

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

Solution (Python):


from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    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)]  
    print(f'{solve(N, K, h)}')


if __name__ == '__main__':
    main()

Solution (Python):
num_persons, need_height = map(int, input().split())
a = map(int, input().split())
height_list = list(a)

count_height_ok = 0

for i in height_list:
    if i >= need_height:
        count_height_ok += 1

print(count_height_ok)

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

print(int(count))

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

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

Solution (Python):

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


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


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


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

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

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

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

people,hlimit = map(int,input().split())
height = list(map(int,input().split()))


check = []
for i in range(0,people,1):
  if height[i] >= hlimit:
    check.append("OK")
  else:
    check.append("NG")
hcnt = check.count("OK")
print(hcnt)

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

Solution (Python):
import bisect

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

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

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

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

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

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

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

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

for i in range(N):
    if not H[i] >= K:
        print(i)
        sys.exit()
        
print(N)

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

Solution (Python):
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
if list_h[-1] < k:
    print("0")
    exit()
count = 0
for count in range(0, n):
    if list_h[count] >= k: break
print(len(list_h[count:]))

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

S=0
for h in H:
    S+=h>=K
print(S)

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

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

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

def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h

print(nibu(K, h))

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 high in h:
    if high >= k:
        ans = 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())  
argList = list(map(int, input().split()))
print(sum([h >= k for h in argList]))

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N, K = map(int, readline().split())
    h = list(map(int, readline().split()))
    ans = 0
    for x in h:
        if x >= K:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
r=input().split()
N=int(r[0])
K=int(r[1])
d=[int(s) for s in input().split()]
ans=0
for i in range(N):
    if d[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 range(n):
    if h[i]>=k:
        c+=1
print(c)

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

print(ans)

Solution (Python):
n,k = map(int,input().split())
ans = 0
h = list(map(int,input().split()))
h.sort()
if h[n-1] < k:
    print(0)
    exit()
while True:
  if h[ans] >= k:
    break
  else:
    ans += 1
print(len(h[ans:]))

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=map(int,input().split())
h=list(map(int,input().split()))
l=len(h)
x=[False for x in range(l)]
for i in range(l):
    if h[i]>=K:
        x[i]=True
print(x.count(True))

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

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

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

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

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

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

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

Solution (Python):


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

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

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

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

Solution (Python):
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()))
h.sort()
ans = 0

for i in range(n):
  if h[i] >= k:
    ans = n-i
    break

print(ans)

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

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

    for h in h_lst:
        if h >= k:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

total = 0

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

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

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

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

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

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

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

cnt=0

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

print(cnt)

Solution (Python):
import numpy as np

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

print(np.count_nonzero(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):
n,k=list(map(int, input().split()))
h=list(map(int, input().split()))
h.sort()
out=0
for i in h:
    if i < k:
        out+=1
    else:    
        break
out=n-out
print(out)

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

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy








def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

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

Solution (Python):
import numpy as np

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

H = np.array(h)

answer = np.sum(H >= K)

print(answer)

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

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

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

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

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 = 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):
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):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

cnt = 0
for h in H:
    cnt += h >= K
    
print(cnt)

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

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

Solution (Python):
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
count = N
for i in range(N):
    if H[i]>=K:
        count = i
        break
print(N-count)

Solution (Python):
N, K = list(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()))
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 = [int(i) for i in input().split()]
s = 0
for i in h:
    if i >= k:
        s += 1
print(s)

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

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

print(ans)

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

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

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

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

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


print(cnt)

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

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

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

print(count)

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

print(res)