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



Sample input:
4 150
150 140 100 200


Sample output:
2

Submission status: Accepted

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

count = 0
for height in heights:
    if k <= height:
        count = count + 1

print(count)

Submission status: Accepted

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

person = 0

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

print(person)

Submission status: Accepted

Solution code:
N, K = map(int,input().split())
H = list(map(int,input().split()))
s = 0
for i in H:
    if K <= i:
        s += 1

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

h_l = [int(i) for i in h if i >= K]

print(len(h_l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    h = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    print(f'{solve(N, K, h)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
num_persons, need_height = map(int, input().split())
a = map(int, input().split())
height_list = list(a)

count_height_ok = 0

for i in height_list:
    if i >= need_height:
        count_height_ok += 1

print(count_height_ok)

Submission status: Accepted

Solution code:
n,k=list(map(int ,input().split()))
h=list(map(int ,input().split()))
count=0
for i in range(0,len(h)):
	if(h[i] == k or h[i] >=k ):
		count+=1
	else:
		count+=0

print(int(count))

Submission status: Accepted

Solution code:
import numpy as np

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

print(np.sum(h >= K))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def answer(n: int, k: int, h: []) -> int:
    return len(list(i for i in h if k <= i))


def main():
    n, k = map(int, input().split())
    h = map(int, input().split())
    print(answer(n, k, h))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

def ans142(N:int, K:int, h:list):
    N=int(N)
    K=int(K)
    count=0
    if N==1:
        h=int(h)
        if h>=K:
           return(1)
        elif h<K:
           return(0)
    else:
     h=h.split()
     for i in range(0,N):
        if int(h[i])>=K:
            count+=1
     return(count)
print(ans142(N,K,h))

Submission status: Accepted

Solution code:
n,k=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)

Submission status: Accepted

Solution code:
# 数値の取得
people,hlimit = map(int,input().split())
height = list(map(int,input().split()))

# 条件に適合する人数をチェックし出力
check = []
for i in range(0,people,1):
  if height[i] >= hlimit:
    check.append("OK")
  else:
    check.append("NG")
hcnt = check.count("OK")
print(hcnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC142B
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

for i in range(N):
    if not H[i] >= K:
        print(i)
        sys.exit()
        
print(N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
if list_h[-1] < k:
    print("0")
    exit()
count = 0
for count in range(0, n):
    if list_h[count] >= k: break
print(len(list_h[count:]))

Submission status: Accepted

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

S=0
for h in H:
    S+=h>=K
print(S)

Submission status: Accepted

Solution code:

# ABC142

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x <= arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h

print(nibu(K, h))

Submission status: Accepted

Solution code:

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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N 人
# 身長 K cm以上必要
# i番目の身長 hi
# 乗れる人数
N, K = map(int, input().split())
h = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
A, K = [int(x) for x in input().split()]
print(sum(int(x) >= K for x in input().split()))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    N, K = map(int, readline().split())
    h = list(map(int, readline().split()))
    ans = 0
    for x in h:
        if x >= K:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
r=input().split()
N=int(r[0])
K=int(r[1])
d=[int(s) for s in input().split()]
ans=0
for i in range(N):
    if d[i]>=K:
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
ans = 0
h = list(map(int,input().split()))
h.sort()
if h[n-1] < k:
    print(0)
    exit()
while True:
  if h[ans] >= k:
    break
  else:
    ans += 1
print(len(h[ans:]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
h=list(map(int,input().split()))
l=len(h)
x=[False for x in range(l)]
for i in range(l):
    if h[i]>=K:
        x[i]=True
print(x.count(True))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum([i >= K for i in H]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 問題：https://atcoder.jp/contests/abc142/tasks/abc142_b

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n, k = map(int, input().split())
    h_lst = list(map(int, input().split()))
    ans = 0

    for h in h_lst:
        if h >= k:
            ans += 1

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

total = 0

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

Submission status: Accepted

Solution code:
n,k=map(int, 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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

print(np.count_nonzero(H >= K))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=list(map(int, input().split()))
h=list(map(int, input().split()))
h.sort()
out=0
for i in h:
    if i < k:
        out+=1
    else:    
        break
out=n-out
print(out)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353

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)

Submission status: Accepted

Solution code:
# ABC142
# Roller Coaster
n, k = map(int, input().split())
H = list(map(int, input().split()))
ct = 0
for i in range(n):
    if H[i] >= k:
        ct += 1
print(ct)

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n, k = inpm()
hl = inpl()
ans = 0
for h in hl:
    if(h >= k):
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

H = np.array(h)

answer = np.sum(H >= K)

print(answer)

Submission status: Accepted

Solution code:
n, k = list(map(int, input().split()))
nums = list(map(int, input().split()))
print(sum(map(lambda p: p>=k, nums)))

Submission status: Accepted

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

cnt = 0
for h in H:
  if h >= K:
    cnt += 1
  else:
    break
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n,k = list(map(int, input().split()))
h = list(map(int, input().split()))
ans = sum(item>=k for item in h)
print(ans)

Submission status: Accepted

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

cnt = 0
for h in H:
    cnt += h >= K
    
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
count = N
for i in range(N):
    if H[i]>=K:
        count = i
        break
print(N-count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
s = 0
for i in h:
    if i >= k:
        s += 1
print(s)

Submission status: Accepted

Solution code:
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 K <= H[i]:
        ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

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


print(cnt)

Submission status: Accepted

Solution code:
n,k = map(int,input().split(' '))
l = list(map(int,input().split(' ')))
count = 0

for i in l:
    if i >= k:
        count += 1
    else:
        continue

print(count)

Submission status: Accepted

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

print(res)

Submission status: Accepted

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

s = 0
for x in h:
    if x >= k:
        s += 1

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = list(map(int, input().split()))
list = list(map(int, input().split()))
ans = [l for l in list if l >= k]

print(len(ans))

Submission status: Accepted

Solution code:
n, k = list(map(int, input().split()))
h = list(map(int, input().split()))
print(len(list(filter(lambda x: x >= k, h))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split(' '))
h_ls = map(int, input().split(' '))
cnt = 0
for i in h_ls:
    if i >= K:
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = list(map(lambda n: int(n), input().split(" ")))
h = list(map(lambda x: int(x), input().split(" ")))
print(len(list(filter(lambda height: height >= K, h))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a = 0
for hh in h:
    if hh >= k:
        a += 1
    else:
        break
print(a)

Submission status: Accepted

Solution code:
from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
MOD=10**9+7
import random
#####################################
n,k=INPUT()
A=INPUT()
ans=0
for i in A:
    if i>=k:
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
MM = input().split()
N = int(MM[0])
K = int(MM[1])
HH = input().split()
total = 0
for i in HH:
  if int(i) >= K:
    total +=1
print(total)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum([1 if h >= K else 0 for h in H]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

h.sort()
ans = len(h)

for height in h:
    if height < k:
        ans -= 1
    else:
        print(ans)
        exit()

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

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)

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

def main():

    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)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 hi in h:
    if (hi >= k):
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n , k = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse = True)

for i in range(n):
    if h[i] < k:
        print(i)
        break
else:
    print(n)

Submission status: Accepted

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

Submission status: Accepted

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