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

total = 0
for height in h:
  if height >= K:
    total += 1
    
print(total)

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

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

Solution (Python):
import sys

def ILI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def ISI(): return map(int, sys.stdin.readline().rstrip().split())

n, k = ISI()
H = ILI()
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()))
count = 0

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

print(count)

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

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

print(ans)

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

Solution (Python):
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N, K = rl()
H = rl()

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

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

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

ans = 0
for h in hs:
    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,1):
    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 h:
	if i >= k:
		count += 1

print(count)

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

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

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):
def main():
    n,k = list(map(int, input().split()))
    lis = list(map(int, input().split()))
    ans = 0
    for v in lis:
        if v >= k:
            ans += 1
    print(ans)

if __name__ == '__main__':
    main()

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

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

print(c)

Solution (Python):
N, K = map(int, input().split())
High = list(map(int, input().split()))
ans = 0
for h in High:
    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 x in h:
  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 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):
N, K = map(int, input().split())
n = list(map(int, input().split()))
result = [i for i in n if i >= K]
print(len(result))

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

print(R)

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

Solution (Python):

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

Solution (Python):
n,h=map(int,input().split())
a=[0]*n
a[:]=map(int,input().split())
b=[1 if ii>=h else 0 for ii in a]
print(sum(b))

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

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

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

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

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

Solution (Python):
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,k=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
ans=0
for i in a:
    if(i>=k):
        ans+=1
print(ans)

Solution (Python):
import math
import time
from collections import defaultdict, deque
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
n,k=map(int,stdin.readline().split())
a=list(map(int,stdin.readline().split()))
ans=0
for i in a:
    if(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())
List = list(map(int, input().split()))

ans=0
i=0
while i<N:
    if List[i]>=K:
        ans+=1
    i+=1
    
print(ans)

Solution (Python):
import itertools
import math
import fractions
import functools
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 = [int(x) for x in input().split()]
cnt=0
for i in range(n):
    if h[i] >= k:
        cnt+=1
print(cnt)

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

count = 0
for h in hhh:
  if h >= k:
    count += 1
    
print(count)

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

Solution (Python):

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

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

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):
import numpy as np
n, k = map(int, input().split())
h = np.array(list(map(int, input().split())))
h = (h >= k)
print(sum(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()))
cnt = 0
for i in range(N):
  if h[i] >= K:
    cnt += 1
  else:
    pass
print(cnt)

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


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

Solution (Python):
import numpy as np
n, k = map(int, input().split())
nlist = np.array(list(map(int, input().split())))
print(len(nlist[nlist>=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()))

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, 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):
x = input().split()
y = input().split()
n = int(x[0])
k = int(x[1])
sum = 0

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

Solution (Python):


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

Solution (Python):
import sys
import math
import bisect


def main():
    n, m = map(int, input().split())
    A = list(map(int, input().split()))
    ans = 0
    for a in A:
        if a >= m:
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

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

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:
    cnt=i
    break
if max(l)>=k:
  print(n-cnt)
else:
  print(0)

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):
import sys
import math
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":
    n,k = I2()
    h = intl()
    cnt = 0
    for i in range(n):
        if h[i] >= k:cnt += 1
    print(cnt)

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

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

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

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

Solution (Python):


getarr = lambda _f: list(map(_f, input().split()))

n, k = getarr(int)
h = getarr(int)

print(sum([1 if hi >= k else 0 for hi in h]))

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

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

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

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

count = 0

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

print(count)

Solution (Python):
n,m=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for i in range(0,len(a)):
  if a[i]>=m:
    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):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


n, k = Is()
H = LI()

C = [x for x in H if x >= k]
print(len(C))

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

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

Solution (Python):
import sys
import math
from fractions import gcd

input = sys.stdin.readline

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

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(h[np.where((h - K)>=0)].shape[0])

Solution (Python):
N, K = map(int, input().split())
L = 0
h = [int(X) for X in input().split()]
for i in range(len(h)):
    if K <= h[i]:
        L +=1
print(L)

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

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

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

print(ans)

Solution (Python):


N, K = map(int, input().split())
print(len([h for h in map(int, input().split()) if K <= h]))

Solution (Python):
n, limit = map(int, input().split())
m = sorted(map(int, input().split()))
print(sum(i >= limit for i in m))

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

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

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

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

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

print(res)

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

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

count = 0
for i in range(n):
    height = h_lst[i]

    if height>=k:
        count += 1

print(count)

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

import numpy as np

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

print(np.sum(np.where(Hs>=K,1,0)))

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

Solution (Python):
def main():
    N, k = map(int, input().split())
    M = list(map(int, input().split()))
    num = 0
    for m in M:
        if m >= k:
            num += 1
    print(num)


if __name__ == "__main__":
    main()

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

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

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

print(len([i for i in array if i >=m]))

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

h.sort()
flag=1
i=0

if h[-1]<K:
    flag=0

if flag==1:
    while h[i]<K:
        i+=1

print(N-i if flag==1 else 0)

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

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

def resolve():
    n,k=map(int, input().split())
    l=list(map(int,input().split()))
    cnt=0
    for i in l:
        if i>=k:
            cnt+=1
    print(cnt)
resolve()

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

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

for x in h:
    if x >= K:
        ans += 1
    if x < K:
        break

print(ans)

Solution (Python):

def inputlist(): return [int(k) for k in input().split()]

N,K = inputlist()
h = inputlist()
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=n
for i in h:
    if i<k:
        ans-=1
print(ans)

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

print(count)

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

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

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

Solution (Python):

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

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

ans = 0

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

print(ans)

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

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

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

print(ans)

Solution (Python):


def main():
    *I, = map(int, open(0).read().split())
    N = I[0]
    K = I[1]
    h = I[2:]

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

main()

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

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

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

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

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

Solution (Python):
n,k=map(int,input().split())
ans=0
h=list(map(int,input().split()))
for i in range(n):
    if k<=h[i]:
        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):
import sys
import os
import math
import string
import collections

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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

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

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

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

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

print(cnt)

Solution (Python):
N, K = (int(x) for x in input().split())
count = 0
h = [int(x) for x in input().split()]
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()))
can_ride = 0

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

print(can_ride)

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

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

Solution (Python):
import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.stdin.readline().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()))
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 = list(map(int,input().split()))
count = 0
for i in range(n):
    if h_list[i] >= k:
        count += 1
print(count)

Solution (Python):

N, K = map(int, input().split())
print(len([x for x in list(map(int, input().split())) if x >= 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
    else:
        pass

print(ans)

Solution (Python):
import numpy as np
n, k = map(int, input().split())
h = np.array([input().split()], np.int64)
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 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 h:
    if k <= i:
        count += 1

print(count)

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())
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 = np.array(list(map(int,input().split())))
ans = len(h[h>=K])
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()))
count = 0

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

print(count)

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

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

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

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

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

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

count = 0
for height in list:
    if height >= K:
        count = count + 1
print(count)

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

print(len(h))

Solution (Python):


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

j = 0
for i in range(N):
  if (high[i] >= K):
    j += 1
  else:
    pass

print(j)

Solution (Python):
import os

def main():
	n,k = map(int, input().split())
	h_list = list(map(int, input().split()))
	count = 0

	for i in h_list:
		if k <= i:
			count += 1
		else:
			pass
	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):
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(N):
    if H[i] >= K:
        count += 1

print(count)

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

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

Solution (Python):

import math


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


i = 0 
p = 0 


while i < n:
    if int(members[i]) < k:
        p += 1
    i += 1


print(n-p)

Solution (Python):
from math import factorial as fact
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime

def input1():
	return int(input())


def input2():
	return map(int,input().split())


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

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(n,r))

def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)



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

Solution (Python):


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

print(len([0 for x in input().split() if int(x) >= k]))

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

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