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

print(ans)

Solution (Python):



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

if __name__=='__main__':
  main()

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

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

print(count)

Solution (Python):
import sys
n, k, *h = map(int, sys.stdin.buffer.read().split())
ans = 0
for i in h:
    if i >= k:
        ans += 1
print(ans)

Solution (Python):
n,k = map(int,input().split())
arrh = list(map(int,input().split()))
arrh.sort(reverse=True)
for i in range(n):
    if arrh[i] < k:
        print(i)
        break
    if i == n-1:
        print(n)

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

Solution (Python):


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

main()

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

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

print(ans)

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

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

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

result = list(filter(lambda i: i >= k, h))

print(len(result))

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

print(len(list(filter(lambda p: p >= k, h))))

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()))
h.sort(reverse =True)

for i in range (N):
    if h[i] < K :
        print(i)
        break
else:
    print(N)

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

can_ride = [x for x in h if x >= K]
print(len(can_ride))

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

Solution (Python):



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

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

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

r = 0
for hh in filter(lambda x: x >= K, h):
    r += 1

print(r)

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

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

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

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

ans = 0
for h in H:
  if int(h) >= 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()))
num = 0

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

print(num)

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

Solution (Python):




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


if __name__ == "__main__":
    main()

Solution (Python):
N,K=map(int,input().split())
high_list=list(map(int,input().split()))
new_list=sorted(high_list,reverse=True)
for i,j in enumerate(new_list):
    if j<K:
        ans=i
        break
else:
    ans=N
print(ans)

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

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

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


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,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())
H=sorted(list(map(int,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())
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()))
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):
p = list(map(int, input().split()))
h = list(map(int, input().split()))
n = p[0]
k = p[1]

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

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

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 = cnt + 1

print(cnt)

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

for i in range(len(x)):
    if x[i]<B:
        A=A-1


print(A)

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

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

n = 0
for h in H:
  if h >= K:
    n += 1
  else:
    break

print(n)

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

Solution (Python):
import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) 
A = [int(input()) for _ in range(N)] 
lst = [list(map(int,input().split())) for i in range(M)] 
"""

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N,K = MI()
	hh = LI()
	ans = 0
	for h in hh:
		if h >= K:
			ans+=1
	print(ans)

main()

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

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

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

Solution (Python):
x,y = map(int,input().split())

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

count = 0

for i in t:
    if y <= i:
        count += 1

print(count)

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

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

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

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

ans = 0
for i in h:
    if k <= i:
        ans += 1

print(ans)

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

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

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

Solution (Python):
n,k = map(int,input().split())
high = [int(i) for i in input().split()]
ans = []

for i in high:
    if k <= i:
        ans.append(i)
print(len(ans))

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, K = MAP()
H = LIST()

total = 0
for i in H:
	if i >= K:
		total += 1

print(total)

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 bisect

n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(n - bisect.bisect_left(h, k))

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

ans = 0
for i in h_list:
    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())
print(sum(map(lambda x:x>=K, map(int, input().split()))))

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())
h=[int(x) for x in 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()))

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

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

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

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

Solution (Python):
n,k=map(int,input().split())
*h,=map(int,input().split())
h.sort(reverse=True)
cnt=0
for i in h:
    if i>=k:
        cnt += 1
    else:
        break
print(cnt)

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

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

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

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

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

count = 0
for a in AS:
  if a >= 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):
def main(N,K,h):
    h.sort()
    count = 0
    for i in range(len(h)):
        if h[i] < K:
            count += 1
        else:
            break
    return N - count

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

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

Solution (Python):
from bisect import bisect_left

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

hight_list.sort()
count = bisect_left(hight_list, k)
print(n - count)

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

Solution (Python):
import sys
input=sys.stdin.readline
N,K=map(int,input().split())
L=list(map(int,input().split()))
print(sum(1 for i in L if i>=K))

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

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

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

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

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

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

print(ppl)

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

count=0

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

print(count)

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

cnt = 0
for num in nums:
    if num >= 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()))
s=[]
for i in range(0,len(h)):
  if h[i]>=K:
    s.append(h[i])
print(len(s))

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

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

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

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

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

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

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

Solution (Python):
def solve(inp):
    (N, K) = map(int, inp.readline().strip().split(' '))
    H = list(map(int, inp.readline().strip().split(' ')))

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

    return str(r)


def test(s):
    from io import StringIO
    print(solve(StringIO(s)))


def main():
    import sys
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    
    main()

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

Solution (Python):
n, k = map(int, input().split())
height = [int(i) for i in input().split()]
cnt = 0
for height_i in height:
    if k <= height_i:
        cnt += 1
print(cnt)

Solution (Python):
from bisect import bisect_left

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

h.sort()
cnt = bisect_left(h, k)
print(n-cnt)

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

count = 0

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

Solution (Python):

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

res = 0
for i in d:
    if i >= k:
        res += 1
print(res)

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, K = MAP()
H = LIST()
c = 0
for i in range(N):
    if K <= H[i]:
        c += 1

print(c)

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

possible = [h[x] for x in range(n) if h[x] >= k]
print(len(possible))

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

N = ip[0]
K = ip[1]

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

print(ans)

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

for i in range(len_height_list):
    if height_list[i] >= K:
        count += 1
        
print(count)

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

Solution (Python):

 
import math
import itertools
import sys
import copy
 





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(len(h)):
  if h[i] >= K:
    ans += 1
print(ans)

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

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

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

print(ans)

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

for i in range(n):
  if sList[i] >= k:
    print(len(sList[i:]))
    exit(0)
print(0)

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

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

ans = 0
for i in hi:
    if k <= i:
        ans += 1

print(ans)

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

print(count)

Solution (Python):
a=input()
b=input()
aa=a.split(' ')
N,K=int(aa[0]),int(aa[1])
hn = [int(b0) for b0 in b.split(' ')]

c=0
for hi in hn:
    if hi >= K:
        c += 1

print(c)

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

total = sum(x >= K for x in heights)
print(total)

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

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

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

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


main()

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

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

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

Solution (Python):
def LI():
  return [int(s) for s in input().split()]

N,K = LI()

h_s = LI()
h_s.sort(reverse = True)

count = 0

for h in h_s:
  if h  < K:
    break
  count+=1
  
print(count)

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

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

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

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

print(sum(list(map(lambda x: k <= x, h))))

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

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

print(len(list(filter(lambda h: h>=k, l))))

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

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

print(sum(1 for i in l if i>=k))

Solution (Python):
n, k = map(int, input().split())
l = list(map(int, 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 = 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());print(sum([h>=k for h in map(int,input().split())]))

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

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

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

Solution (Python):
nk = input()
nk_list = nk.split(" ")
n = int(nk_list[0])
k = int(nk_list[1])
h = input()
h_list = h.split(" ")

number = 0
for i in range(n):
    if int(h_list[i]) - k >= 0:
        number += 1
print(number)

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

Solution (Python):

inputA =  list(map(int,input().split()))
inputB =  list(map(int,input().split()))

humancount = inputA[0]
talllimit = inputA[1]
anser = 0

for count in range(0,humancount):
    if inputB[count] >= talllimit:
        anser += 1


print(anser)

Solution (Python):
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))

sys.setrecursionlimit(10 ** 9)


def main():
    N, K = MAP()
    H = LIST()

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

    print(cnt)


if __name__ == '__main__':
    main()

Solution (Python):
n , k, *d = map( int, open(0).read().split() )

prm = [ False ] * n
for i in range( n ):
  prm[ i ] =  d[ i ] >= k
print( sum( prm ))

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

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

L=sorted(L,reverse=True)
ans=N
for i in range(N):
    if L[i]<K:
        ans=i
        break
print(ans)

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

for i in li:
  if i >= b:
    num += 1
print(num)

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

r = 0

for h in hs:
  r += 0 if h < k else 1

print(r)

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

    count = 0

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

    print(count)

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
import itertools

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

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

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

print(ans)

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

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

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

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N, K, *H = map(int, read().split())
print(sum(x >= K for x in H))

Solution (Python):


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

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

print(count)

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)




import numpy as np

N, K = map(int, readline().split())
h = [int(x) for x in readline().split()]

print(len([x for x in h if x-K >= 0]))