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

print(counter)

Solution (Python):
import sys
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
DBG = True 

def ddprint(x):
  if DBG:
    print(x)


n,k = inm()
h = inl()
sm = 0
for i in range(n):
  if h[i]>=k:
    sm += 1
print(sm)

Solution (Python):
n,l = [int(x) for x in input().split()]
h = map(lambda x:x-l, list(map(int, input().split())))
print(sum(x>=0 for x in h))

Solution (Python):
import sys,os,math
from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat








def solve():

    pass

def main():
    n, k = map(int, raw_input().split())
    da = map(int, raw_input().split())
    print len(filter(lambda x:x>=k, da))



main()

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

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

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

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

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

print(cnt)

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

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

Solution (Python):
import bisect

N, K = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
print(N - bisect.bisect_left(h,K))

Solution (Python):



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

cou = 0
for i in h:
    if K<=i:
        cou+=1
print(cou)

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h, reverse=True)
for i, h_i in enumerate(h):
  if h_i >= K:
    continue
  else:
    print(i)
    exit()

print(N)

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

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


ans = 0

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

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

print(ans)

Solution (Python):

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

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


cnt = 0


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


print( cnt )

Solution (Python):
n,k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
s = 0
for i,v in enumerate(a):
  if v>=k:
    s +=1
    
print(s)

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

Solution (Python):
def main():
  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
    else:
      pass
  print(cnt)
if __name__ == "__main__":
  main()

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

c = 0


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

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

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

Solution (Python):
def t(k, h):
    return len([i for i in h if i >= k])


if __name__ == "__main__":
    n, k = map(int, input().split())
    h = map(int, input().split())
    print(t(k, h))

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

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

count = 0

for i in h_list:
  if i >= K:
    count += 1

print(count)

Solution (Python):
import bisect
n,k = input().strip().split()
n,k = [int(n),int(k)]
array = list(map(int,input().strip().split()))
array.sort()
index = bisect.bisect_left(array,k)
print (n - index)

Solution (Python):
nk = input()

num, needh = map(int, nk.split())

heights = input()

count = 0

heightsNum = heights.split()

for i in range(0, len(heightsNum), 1):

    height = int(heightsNum[i])
    if height >= needh:
        count += 1

print(count)

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

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

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

_n, _k = map(int, input().split())
hlist = [item for item in map(int, input().split())]

crlist = [item for item in hlist if item >= _k]
print(len(crlist))

Solution (Python):

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

Solution (Python):


import sys


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



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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

print(sum( y >= int(k) for y in x))

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

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

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

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

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

count = 0
for a in arr:
	if a >= K:
		count += 1
print(count)

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

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

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

Solution (Python):
N = list(map(int,input().split()))
K = list(map(int,input().split()))
count = 0
for i in range(N[0]):
  if N[1] <= K[i]:
    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):
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    h = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for i in range(n):
        if h[i] >= k:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    slove()

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

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

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

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

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

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


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

print(n)

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

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

Solution (Python):
import numpy as np

n, k = [int(each) for each in input().split(' ')]
h = input().split(' ')
heights = np.array([int(each) for each in h])
out = np.where(heights >= k)
print(len(out[0]))

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

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

ans=0
for i in range(len(h_array)):
    if h_array[i]>=k:
        ans+=1
    else:
        break
print(ans)

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

Solution (Python):


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

    print(len(able_ride_jet(k, h)))


def able_ride_jet(const, heights):
    """ ジェットコースターに乗れる人の身長のリストを返す関数
    """
    return list(filter(lambda x: x >= const, heights))


if __name__ == '__main__':
    main()

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

h = [int(i) for i in input().split()] 

def able_ride_jet(const, heights):
    """ ジェットコースターに乗れる人の身長のリストを返す関数
    """
    return list(filter(lambda x: x >= const, heights))

print(len(able_ride_jet(k, h)))

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

ans=0
for i in list_h:
  if K<=i:
    ans+=1
print(ans)

Solution (Python):



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


if __name__ == '__main__':
    main()

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

for i in h:
    if i < K:
        N -= 1
print(N)

Solution (Python):
from sys import stdin
N,K = map(int,stdin.readline().rstrip().split())
h = list(map(int,stdin.readline().rstrip().split()))

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

a = []

for b in h:
  if b >= k:
    a.append(b)

print(len(a))

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    n = II()
    ans = 0
    for i in range(1, n + 1):
        ans += i & 1
    print(ans/n)
    return


def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        ans += i >= k
    print(ans)
    return


def C():
    n = II()
    a = LI()
    d = defaultdict(int)
    for i in range(n):
        d[a[i] + 1] = i + 1
    for _, v in sorted(d.items()):
        print(v, end=" ")
    print()
    return

def primes(n):
    """ Input n>=6, Returns a list of primes, 2 <= p < n """
    """ 6以上の数であれば p (素数) <= n のlistを返す """
    n, correction = n-n%6+6, 2-(n%6>1)
    sieve = [True] * (n//3)
    for i in range(1,int(n**0.5)//3+1):
        if sieve[i]:
            k=3*i+1|1
            sieve[      k*k//3      ::2*k] = [False] * ((n//6-k*k//6-1)//k+1)
            sieve[k*(k-2*(i&1)+4)//3::2*k] = [False] * ((n//6-k*(k-2*(i&1)+4)//6-1)//k+1)
    return [2,3] + [3*i+1|1 for i in range(1,n//3-correction) if sieve[i]]


def D():
    a, b = LI()
    p = primes(int(math.sqrt(max(a, b))) + 1)
    ans = 1
    for i in p:
        if a % i == b % i == 0:
            ans += 1
    print(ans)
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    B()

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

print(cnt)

Solution (Python):
k = int(input().split(" ")[1])
c = 0
for e_h in [int(e) for e in input().split()]:
    if(k <= e_h): c += 1
print(c)

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

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

Solution (Python):
n,k=map(int,input().split())
h=list(map(int,input().split()))
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
h.sort(reverse = True)
for cm in h:
    if cm < K:
        break
    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 = [int(i) for i in input().split()]
count = 0

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

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

print(cnt)

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

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

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

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

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

ans = 0
for i in range(n):
  if a[i] >= m:
    ans += 1

print(ans)

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

num = 0
for hei in h:
	if(hei >= K):
		num+=1
print(num)

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

Solution (Python):
N, K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
ans = 0
for h1 in h:
    if h1 >= K:
        ans += 1
    else:
        break
print(ans)

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

c = 0
for i in HI:
  if i >= H:
    c += 1

print(c)

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 h:
  if i >= K:
    ans += 1

print(ans)

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

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

print(counter)

Solution (Python):
n, k = map(int, input().split())
h_array = sorted([int(x) for x in input().split()])
cnt = 0
for h in h_array:
    if h >= k:
        print(n - cnt)
        exit()
    cnt += 1
else:
  print(n-cnt)

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

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

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

ans = 0
for height in user:
    if height >= K:
        ans += 1

print(ans)

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

for i in range(n):
  if k <= int(h[i]):
    result += 1
  else:
    result -= 0
print(result)

Solution (Python):
num, jet = map(int, input().split())

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

ans = 0

for n in height:
    if n >= jet:
        ans += 1

print(ans)

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

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

result = 0
for i in range(N):
  result += l[i] >= K

print(result)

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

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

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

h.sort()

ans = N

for i in h:
    if i >= K:
        break
    ans -= 1


print(ans)

Solution (Python):
n,k = map(int,input().split())
h = map(int,input().split())
ans = 0
for high in h:
  if high >= 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())
h = list(map(int,input().split()))
a = 0

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

print(a)

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

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

print(a)

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

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

count = 0

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

print(count)

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

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())
print(sum(h >= k for h in map(int, input().split())))

Solution (Python):

import sys


def solve(N: int, K: int, h: "List[int]"):
    print(len(list(filter(lambda i: i >= K, h))))
    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 = list(map(int, input().split()))
h = list(map(int, input().split()))
count = 0
for i in range(len(h)):
    if h[i] >= k:
        count += 1
print(count)

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

N, K = (int(i) for i in input().split())
hs = [int(i) for i in input().split()]
count = 0
for h in hs:
    if h >= K:
        count += 1

print(count)

Solution (Python):
n, k = map(int, input().split())
target_list = [ height for height in input().split() if k <= int(height) ]

print(len(target_list))

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

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

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

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

c =0

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

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

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

print(count)

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

Solution (Python):
def solve():
  n, t = [int(i) for i in input().split()]
  members = [int(i) for i in input().split() if int(i)>=t]
  print(len(members))
  

if __name__ == '__main__':
  solve()

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()))
a = list(map(int, input().split()))
print(sum(i >= k for i in a))

Solution (Python):
INPUT = [input().split() for l in range(2)]
 
N=INPUT[0][0]
K=int(INPUT[0][1])
H=[int(s) for s in INPUT[1]]
 
n = sum(x>=K for x in H)
 
print(n)

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

Solution (Python):
INPUT = [input().split() for l in range(2)]

N=INPUT[0][0]
K=int(INPUT[0][1])
H=[int(s) for s in INPUT[1]]

n = sum(x>=K for x in H)

print(n)

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

Solution (Python):
from heapq import heappush, heappop
import queue
import re
import math
import functools

def s_raw():
    return input().rstrip("\r")

def int_raw():
    return int(input())


def ss_raw():
    return input().split()


def ints_raw():
    return list(map(int, ss_raw()))


INF = 1 << 29


def make1d_arr(n, val=INF):
    return [val for i in range(n)]


def make2d_arr(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]


def gcd(a, b):
    if(b == 0):
        return a
    return gcd(b, a % b)


def BFord(n,es):
    v_cost = [INF]*n
    v_cost[0] = 0
    for v in range(n*2):
        for e in es:
            frm = e[0]
            to = e[1]
            if v_cost[to] > v_cost[frm]+e[2]:
                v_cost[to] = v_cost[frm]+e[2]
                if v >= n:
                    v_cost[to] = -INF
        if v == n-1:
            prev = v_cost[:]
    v_cost = [-INF if prev[idx]!=v_cost[idx] else v_cost[idx] for idx in range(n)]
    return v_cost
    
def ZAlgo(s):
    l = len(s)
    A = [0]*l
    i =1
    j =0
    A[0]=l
    while i<l:
        while i+j<l and s[j] == s[i+j]:
            j+=1
        if j==0:
            i+=1
            continue
        A[i]=j
        k=1
        while (i+k<l) and (k+A[k]<j):
            A[i+k] =A[k]
            k+=1
        i+=k
        j-=k
    return A


def main():
    n,k = ints_raw()
    return sum([a>=k for a in ints_raw()])


if __name__ == "__main__":
    print(main())

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

Solution (Python):
N, K = map(int, input().split())
*H, = map(int, input().split())
print(len(list(filter(lambda x: x >= 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):
m = list(map(int, input().split()))
n = list(map(int, input().split()))
k = m[1]

cnt = 0

for i in n:
  if int(i) >= k:
    cnt += 1

print(cnt)

Solution (Python):
line = input()
n, k = [int(item) for item in line.strip().split(' ')]
line = input()
h = [int(item) for item in line.strip().split(' ')]

count = 0
for item in h:
    if item >= k:
        count += 1

print(count)

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

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

Solution (Python):
_, l = map(int, raw_input().split())                                                                                                                                                     
h = list(map(int, raw_input().split()))

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

print cnt

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

x = 0
for hi in H:
    if hi >= K:
        x += 1
print(x)

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

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

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

Solution (Python):
temp = input().split(" ")
k = int(temp[1])
height = input().split(" ")

count = 0
for person in height:
  if int(person) >= k:
    count += 1

print(count)

Solution (Python):
n,k=(int(x) for x in input().split())
h=list(map(int,input().split()))
a=0
for y in h:
  if k<=y:
    a+=1
print(a)

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

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

Solution (Python):
import sys
def input():
    return sys.stdin.readline()[:-1]

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

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

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

Solution (Python):
_, limit = map(int, raw_input().split())
ns = map(int, raw_input().split())

print len([n for n in ns if n >= limit])

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

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

count=0
for value in li:
  if value>=k:
    count+=1
    
print(count)

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

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

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

count = 0

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

print(count)

Solution (Python):

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

count = 0
for height in height_list:
    if height >= k:
        count += 1

print("{}".format(count))

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

for f in friends:
  if f >= K:
    ret = ret + 1

print(ret)

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=list(map(int,input().split()))
hi=list(map(int,input().split()))
jet = [x for x in hi if x >= K]
print(len(jet))

Solution (Python):

str_N, str_K = input().split()
height = input().split()

int_N = int(str_N)
int_K = int(str_K)

for i in range(len(height)):
    height[i] = int(height[i])

k = 0

for j in height:
    if j >= int_K:
        k += 1

print(k)

Solution (Python):
N,K = map(int,input().split())
hs = list(map(int, input().split()))
hs.sort()
result = 0
for i in range(N):
    if hs[i] >=K:
        result = N -i
        break
print(result)

Solution (Python):
inp1 = input().split()
height=input().split()
ridable=[i for i in height if int(i)>=int(inp1[1])]

print(len(ridable))

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


if __name__ == "__main__":
    main()

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

res = 0

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

print(res)