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):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N,K=two_int()
H = many_int()
count = 0
for i in H:
    if K<=i:
        count+=1
print(count)

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

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    
        
        
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    R = lambda: list(map(int, r().split()))
    Rmap = lambda: map(int, r().split())
    Rfloat = lambda: list(map(float, r().split()))
    Rtuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    

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

    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):

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

Solution (Python):
def main():
    n,k=map(int,input().split())
    ans=n
    for i in list(map(int,input().split())):
        if i<k:
            ans-=1
    print(ans)
    
main()

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

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

    print(ans)

    
    


if __name__ == '__main__':
    main()

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

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

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

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

ami = [int(i) for i in input().split()]
a = 0
for i in ami:
    if i >= k:
        a += 1
        
print(a)

Solution (Python):


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

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

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

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

Solution (Python):


import sys

sys.setrecursionlimit(100000)
MOD = 10 ** 9 + 7





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

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

print(ans)

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

Solution (Python):


import sys



tmp = input().split()
n,k = list(map(lambda a: int(a), tmp))
tmp = input().split()
h = list(map(lambda a: int(a), tmp))

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

print(count)

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

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

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

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

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

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

Solution (Python):
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

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

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

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

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

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

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

h.sort()

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

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

cnt = 0

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

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

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

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

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

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

print(len([1 for i in map(int, input().split()) if i >= k]))

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

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

print(ans)

Solution (Python):
N,K=map(int,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=list(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):
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue


Mod = 1000000007
 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): 
    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)
if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):
import sys
n,k=map(int,input().split())
a=sorted(map(int,input().split()))
for i in range(n):
    if k<=a[i]:
        print(n-i)
        sys.exit()
print(0)

Solution (Python):



 
import sys
import math



 

fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile


mod=1000000007
 

def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 

t=1
for tt in range(t):
    
    n,k= map(int, sys.stdin.readline().split(' '))
    a=list(map(int,sys.stdin.readline().split(' ')))
    ans=0
    for b in a:
        if(b>=k):
            ans+=1
    print(ans)
    
    

if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

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

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

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

sum = 0

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

print(sum)

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

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

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

cnt = 0
for i in H:
  if i >= K:
    cnt += 1
print(cnt)

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

print(ans)

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

count = 0

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

print(count)

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

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

Solution (Python):
N,K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
cnt = 0
for i in A:
  if K<=i:
    cnt += 1
print(cnt)

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

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

print(cnt)

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

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

ans = 0
for height in h:
    if K <= height:
        ans += 1

print(ans)

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

Solution (Python):
N, K = [int(x) for x in input().split()]
import numpy as np
h = np.array([int(x) for x in input().split()])
print(h[h>=K].shape[0])

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

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

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

ans = 0
for a in A:
    if a >= K:
        ans += 1
print(ans)

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

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

Solution (Python):
from sys import stdin
N,K = [int(x) for x in stdin.readline().rstrip().split()]
H = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
for i in H:
    if i >= K:
        ans += 1
print(ans)

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

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

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

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

print(cnt)

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

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

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

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

print(N-bisect.bisect_left(h, K))

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



def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    n, k = rli()
    lh = rli()
    print(sum(1 for h in lh if h >= k))


if __name__ == '__main__':
    main()

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

for x in h:
    if x >= k:
        res += 1

print(res)

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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

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

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

print(counter)

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

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

print(cnt)

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

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N,K = inputMap()
	h = inputList()

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

	print(ans)


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

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

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

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

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

Solution (Python):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

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

count = 0
for hh in H:
    if hh >= K:
        count += 1
print(count)

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

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

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

print(ans)

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

H = list(map(int, input().split()))
ctr = 0

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

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

count=0

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

print(count)

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

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

Solution (Python):
import bisect

import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

cannot = bisect.bisect_left(H, K)
print(N-cannot)

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

print([x>=k for x in h].count(True))

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

Solution (Python):
def getlist():
	return list(map(int, input().split()))

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

print(ans)

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

Solution (Python):

n, k = [int(x) for x in input().split()]
heihgts = [int(x) for x in input().split()]


cnt = 0

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

Solution (Python):
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n, k = LI()
    hs = LI()
    ans = 0
    for h in hs:
        if h >= k:
            ans += 1
    print(ans)

if __name__ == '__main__':
    main()