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):
import sys
from io import StringIO
import unittest

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

    print(sum([1 for hh in h if hh >= k]))

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """4 150
150 140 100 200"""
        output = """2"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1 500
499"""
        output = """0"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """5 1
100 200 300 400 500"""
        output = """5"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

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

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

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

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

Solution (Python):

N, K = [int(s) for s in input().split()]
h = [int(s) for s in input().split()]

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

Solution (Python):
import numpy as np
n, k = map(int, input().split())
aa = np.array(list(map(int, input().split())))
print(sum(aa >= k))

Solution (Python):
line1 = input()
line2 = input()
n, k = line1.split(" ")
h_list = line2.split(" ")
k = int(k)
h_list = [int(h) for h in h_list]

ans = 0

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

Solution (Python):
import sys
from bisect import bisect_right as bsr
from collections import Counter as cnt
from collections import defaultdict as dd
from collections import deque
from fractions import gcd
from itertools import combinations as comb
from itertools import permutations as perm
from math import ceil, factorial, floor
from operator import itemgetter as ig

sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    N, K = input(int, int)
    H = input([int, N])
    print(len([h for h in H if K <= h]))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Solution (Python):

import sys
input=sys.stdin.readline
from heapq import heappop,heapify

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

for i in range(N):
    h[i]=0-h[i]
heapify(h)
ans=0

while ans!=N:
    if heappop(h)<=(-K):
        ans+=1
    else:
        break

print(ans)

Solution (Python):

import sys
input=sys.stdin.readline

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

print(ans)

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

for num in h:
    if num>=k:
        cnt+=1
print(cnt)

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n, k = map(int, input().split())
    H = list(map(int, input().split()))

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


if __name__ == '__main__':
    resolve()

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

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

print(res)

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

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

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

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

Solution (Python):
import itertools


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

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

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

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

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

Solution (Python):
x = input()
y = input()
n = int(x.split()[0])
k = int(x.split()[1])
list = y.split(' ')
count = 0

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

print(count)

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

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, groupby
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, K = MAP()
h = LIST()
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()))
count = 0
for h in H:
    if h >= K:
        count = count+1
print(count)

Solution (Python):
friends, minimum_height = map(int, input().split())
friends_height = list(map(int, input().split()))

tall_friends = 0

for i in range(friends):
  if friends_height[i]>=minimum_height:
    tall_friends += 1
print(tall_friends)

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

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

Solution (Python):
_,a = list(map(int,input().split()))
hoge = list(map(int,input().split()))
count = 0
for i in hoge:
  if i >= a:
    count += 1
print(count)

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

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

for high in h:
    if high >= 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):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  N, K = map(int, readline().split())
  H = list(map(int, readline().split()))
  ans = N
  for i in range(N):
    if H[i]<K:
      ans -= 1
  print(ans)
  
  
if __name__ == '__main__':
  main()

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

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

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

a = list(map(int,input().split()))
print(sum([1 if x >= K else 0 for x in a]))

Solution (Python):


import sys


















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    _, k = mi()
    h_passed = list(filter(lambda x: x>=k, lmi()))
    print(len(h_passed))


if __name__ == "__main__":
    main()

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

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

Solution (Python):

import sys
import numpy as np


def solve(N: int, K: int, h: "List[int]"):
    c = 0
    for i in range(N):
        if h[i]>=K:
            c+=1
    print(c)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    K = int(next(tokens))  
    h = [int(next(tokens)) for _ in range(N)]  
    solve(N, K, h)

if __name__ == '__main__':
    main()

Solution (Python):

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


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

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 n in range(N):
    if H[n]>=K:
        ans+=1
print(ans)

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

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

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

print(n)

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

if __name__ == "__main__":
    main()

Solution (Python):
inp = list(map(int, input().split()))
n, k = inp[0], inp[1]
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):
a,b=map(int,input().split())
s=list(map(int,input().split()))

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

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

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

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

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

Solution (Python):
nim, mike = map(int, input().split())

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

print(sum(zen >= mike for zen in kite))

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

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

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

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

Solution (Python):
def q2():
    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 H[i] >= K:
            ans += 1
    print(ans)


if __name__ == '__main__':
    q2()

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

Solution (Python):

"""
B - Roller Coaster
https://atcoder.jp/contests/abc142/tasks/abc142_b

"""
import sys


def solve(N, K, heights):
    return sum(1 for h in heights if h >= K)


def main(args):
    N, K = map(int, input().split())
    heights = [int(h) for h in input().split()]
    ans = solve(N, K, heights)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

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

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

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

print(count)

Solution (Python):
import sys


def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

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

def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))


n,k=MI()
h=LI()

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

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

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

Solution (Python):
N, K = map(int,input().split())
ary1 = map(int,input().split())
print(sum(x>=K for x in ary1))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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


if __name__ == '__main__':
    main()

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

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

num_of_rideable = 0

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

print(num_of_rideable)

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

x = 0
for hh in h:
    if hh >= k:
        x += 1
print(x)

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 = len([1 for h in H if h >= K])
print(ans)

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

ac = [H[i] for i in range(len(H)) if H[i] >= K]
print(len(ac))

Solution (Python):
import math

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

cnt = 0

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

print(cnt)

Solution (Python):
n, limit = map(int, input().split())
height = list(map(int, input().split()))

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

print(count)

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

Solution (Python):
n,k=[int(i) for i in input().split()]
h=[int(i) for i in 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()))
h.sort()
for i in range(N):
    if h[i] >= K:
        print(len(h[i:]))
        exit()
print(0)

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

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(map(str, input().split()))
def pl(a): print(" ".join(list(map(str, a))))
def ma():return map(int,input().split())
def nli(x):return [input for _ in range(x)]
def hukusuu(): 
  listA=[] 
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break 
  return listA

n,k=ma()
h=rli()

from itertools import accumulate as acc 
import operator as op
import copy as cp
import math
from bisect import bisect_left as bisl
from bisect import bisect_right as bisr
def ifif(s):
  if s:print("Yes")
  else:print("No")

h.sort()
inde=bisl(h,k)
print(n-inde)

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

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

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

if __name__ == "__main__":
    main()

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

Solution (Python):
N, K = map(int, input().split())
lst = list(map(int, input().split()))
i = 0
for h_i in lst:
    if h_i < K:
        continue
    i += 1
print(i)

Solution (Python):
N, K = map(int, input().split())
lst = list(map(int, input().split()))
i = 0
for h_i in lst:
    if h_i < K:
        continue
    else:
        i += 1
print(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):
a,b=map(int,input().split())
c=list(map(int,input().split()))
d=0
for i in range(a):
  if c[i]>=b:
    d+=1
print(d)

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

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

print(sum)

Solution (Python):
n, k, *A = map(int, open(0).read().split())
print(sum(a >= k for a in 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()))
count = 0
for i in range(N):
    if h[i] >= K:
        count +=1
print(count)

Solution (Python):
import bisect

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

h.sort()

n = bisect.bisect_left(h, K)

print(N - n)

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

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

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

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

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

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

def compare(num, d):
    ''' 
    num >= d --> true
    d < num --> false
    '''
    if num >= d:
        return True
    else:
        return False
ans = 0
for x in h:
    if compare(x,k):
        ans += 1
print(ans)

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

import bisect

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

h.sort()

a = bisect.bisect_left(h,k)

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

Solution (Python):
data = input().split()
N = int(data[0])
K = int(data[1])
h = map(int, input().split())

isGraterThanN = lambda n: lambda value: value >= n
isGraterThanK = isGraterThanN(K)

h_grater_then_k = filter(isGraterThanK, h)
h_grater_then_k = list(h_grater_then_k)

answer = len(h_grater_then_k)
print(answer)

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

print(cnt)

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
from itertools import *
from collections import *

INF = float('inf')

""" Input
S = input().rstrip()
N = int(input())
D = [int(input()) for _ in range(N)]
"""

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

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


if __name__ == '__main__':
    main()

Solution (Python):
n, k = [int(i) for i in 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()))

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

Solution (Python):










"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""
  
def main():
  n,k = map(int,input().split())
  LIST = list(map(int,input().split()))
  cnt = 0
  for i in range(n):
    if LIST[i] >= k:
      cnt +=1
  print(cnt)
if __name__ == '__main__':
  main()

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

cnt = 0
for hight in h:
    if k <= hight:
        cnt += 1

print(cnt)

Solution (Python):
N,K,*H,=map(int,open(0).read().split());A=0
for i in H:A+=1*(i>=K)
print(A)

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

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

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

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

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

Solution (Python):

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

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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,k=INTM()
    l=LIST()
    ct=0
    for i in range(n):
        if l[i]>=k:
            ct+=1
    print(ct)
if __name__ == '__main__':
    do()

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

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