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 = [int(_) for _ in input().split()]
h = [int(_) for _ in 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()))
c = 0
for x in h:
  c += (x >= k)
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
N_K = str(input())
H = str(input()).split(" ")

N = N_K.split(" ")[0]
K = N_K.split(" ")[1]

count = 0
for h in H:
    if int(K) <= int(h):
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(len([t for t in talls if t >= K]))

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

h.sort()

left=-1
right=N

while left<right-1:
   i=(left+right)//2
   if h[i]>=K:
      right=i
   else:
      left=i

print(N-right)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

ans=sum(i>=k for i in h)
print(ans)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	n,k = map(int,input().split())
	# n = int(input())
	# s = str(input())
	a = list(map(int,input().split()))
	# l = [list(map(int, input().split())) for _ in range(n)]
	ans = 0
	for i in range(n):
		if a[i] >= 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()))

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()))
t=[]
for i in range(N):
  if h[i]>=K:
    t.append(h[i])
print(len(t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(N: int, K: int, h: "List[int]"):
    print(len(
        [i for i in h if i >= K]
    ))
    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))  # type: int
    K = int(next(tokens))  # type: int
    h = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, K, h)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np


_, K = map(int, input().split())
H = np.array([inp for inp in map(int, input().split())])
print((H >= K).sum())

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, K = map(int,input().split())
height = list(map(int,input().split()))
number = 0

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

print(number)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K = 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:
import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res


N,K=LI()

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

Submission status: Accepted

Solution code:
N, K = map(int, input().strip().split())
H = list(map(int, input().strip().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())
height = list(map(int, input().split()))
cnt = 0

for h in height:
    if h >= K:
        cnt += 1

print(cnt)

Submission status: Accepted

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

count = 0
for i in list_h:
    if i >= K:
        count += 1

print(count)

Submission status: Accepted

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

list_h.sort()
list_h.insert(0, 0)
list_h.append(500)

L, R = 0, N + 1
while R - L > 1:
    C = (L + R) // 2
    if list_h[C] >= K:
        R = C
    else:
        L = C

print(len(list_h[R:-1]))

Submission status: Accepted

Solution code:
s=input().split()
t=input().split()
lm=int(s[1])
nm=int(s[0])
a=0
for k in range(nm):
  if int(t[k])>=lm:
    a=a+1
print(a)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
n, height = map(int,input().split())

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

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

Submission status: Accepted

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

for i in range(n):

    if h[i] >= k:
        tmp += 1

print(tmp)

Submission status: Accepted

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

count = 0
for f in friends:
    if f >= k:
        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()))

h1 = np.array(h)
print(len(h1[h1>=k]))

Submission status: Accepted

Solution code:
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 + 1

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
cnt = sum(int(i)>=K for i in input().split())
print(cnt)

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

print(sum(i>=K for i in li_h))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
*l,=map(int,input().split())
ans=0
for i in l:
  ans+=i>=k
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())
heights=[int(i) for i in input().split()]
ans=0


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

Submission status: Accepted

Solution code:
import sys

n, k = map(int, sys.stdin.readline().split())
h = list(map(int, sys.stdin.readline().split()))

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

arr = [int(x) for x in stdin.readline().rstrip().split()]


sum = 0
for h in arr:
    if h >= k:
        sum +=1


print(sum)

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0

for i in tall:
  if i >= k:
    count += 1

print(count)

Submission status: Accepted

Solution code:
import sys

n,k = (int(x) for x in input().split())
h = list(map(int , input().split()))
f = 0

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n,k=map(int,input().split())
    print(sum(h>=k for h in map(int,input().split())))
resolve()

Submission status: Accepted

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

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:
A, B = map(int, input().split())
L = list(map(int, input().split()))
ans = 0
for l in L:
  if (l >= B):
    ans+= 1
print(ans)

Submission status: Accepted

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

ans = 0
for hi in h:
    ans += 1 if (hi >= K) else 0

print(ans)

Submission status: Accepted

Solution code:
N,K = list(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 range(n):
    if h[i] >= k:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
N,K= list(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)

Submission status: Accepted

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

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 = res+1
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
print(sum(1 if t >= K else 0 for t in 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()))
ans = 0
for i in h :
  if i >= K :
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
from bisect import bisect_left

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

print(N - bisect_left(H, K))

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

Submission status: Accepted

Solution code:
N, *D, = [list(map(int, s.split())) for s in open(0)]
D = D[0]
num = 0
for i in range(N[0]):
    if D[i] >= N[1]:
        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()))

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

print(count)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

print(count)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

height=[int(x) for x in input().split()]

count=0

for h in height:
    if h>=K:
        count+=1

print(count)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    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:
import sys

num1 = list(map(int, input().split()))
N = num1[0]
K = num1[1]
num2 = list(map(int, input().split()))
ans = 0
for index1 in range(len(num2)):
	if num2[index1]>=K:
		ans +=1
print(ans)

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
l=list(map(int,input().split()))
ans=0
for x in l:
  if x>=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:
#!/usr/bin/env python3
import sys


def solve(N: int, K: int, h: "List[int]"):
    ans = 0
    for n in h:
        if K <= n:
            ans += 1
    print(ans)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    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]"
    solve(N, K, h)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
talls = list(map(int, input().split()))
num = 0
for tall in talls:
  if tall >= k:
    num += 1
print(num)

Submission status: Accepted

Solution code:
_, K = map(int, input().split())
tall = map(int, input().split())


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from itertools import *

N, K = list(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 = input()
N , K = N_K.split(" ")
N = int(N)
K = int(K)
H = input()
H = H.split(" ")
H = map(lambda x: int(x), H)
i=0
for hi in H:
    if hi>=K:
        i = i +1
print(i)

Submission status: Accepted

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

count = 0
for i in H:
    if K <= i:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

ret = 0
for h in hs:
  if h >= k:
    ret += 1

print(ret)

Submission status: Accepted

Solution code:
N,K=list(map(int,input().strip().split()))
h=list(map(int,input().strip().split()))
c=0
for i in h:
    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 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()))

Sum = 0

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

Submission status: Accepted

Solution code:
#ABC142-B Roller Coaster
N, K = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
for i in range(N):
    ans += 1 if h[i] >= K else 0
print(ans)

Submission status: Accepted

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

List = []
for i in range(n):
    if h[i] >= k:
        List.append(h[i])

print(len(List))

Submission status: Accepted

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

Submission status: Accepted

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

r = list(filter(lambda x: x >= K, U))

print( len(r) )

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

print(ans)

Submission status: Accepted

Solution code:
n, k = list(map(int,input().split()))
h = list(map(int,input().split()))
print(sum(list(map(lambda x: 1 if x - k >= 0 else 0, h))))

Submission status: Accepted

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

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

num_of_can_ride = 0

for hi in H:
    if hi >= K:
        num_of_can_ride += 1

print(num_of_can_ride)

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

Submission status: Accepted

Solution code:
# 　abc142_b

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

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

print(count)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
h=list(map(int,input().split()))
c=0
for x in h:
  c += x>=k
print(c)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# coding: utf-8

# 整数 > 整数型
def I(): return int(input())

# 整数列 '1 2 3 4' > 整数型リスト
def IsIl(): return list(map(lambda x: int(x), input().split()))

# 改行挟む整数列　'1/n 2/n 3/n' > 整数型りすと
def InIl(n): return [input() for i in range(n)]

# 整数列 '1 2' > 整数型タプル
def IsIt(): return map(lambda x: int(x), input().split())

# 改行挟む整数列　'1\n 2\n 3\n' > 整数型たぷる
def InIl(n): return map(input() for i in range(n))

# 文字列 'abcd' > 文字型リスト
def SsSl(): return list(map(lambda x: x, input()))

# 整数 '1234' > 整数型リスト

# 文字列 'aba' > 辞書（文字型:個数）{'a':2,'b':1}
def SSd():
    from collections import defaultdict
    A = input() # [int(i) for i in input().split()]
    dd=defaultdict(int)
    for a in A:
        dd[a]+=1
    return dd

#リストにn個要素を読み込む

# その他アルゴリズムテンプレート
# https://qiita.com/chun1182/items/ddf2b6cba932b2bb0d4e

n,k = IsIt()

lis_h = IsIl()

ans = 0
for i_h in lis_h:
    if i_h >= k:
        ans += 1


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
n, k = map(int, input().split())
h0 = list(map(int,input().split()))
h = sorted(h0)
x = bisect.bisect_left(h, k)
print(n-x)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
user_input, acceptable_height = input().split(" ")
user_input = int(user_input)
acceptable_height = int(acceptable_height)
friend_height = input().split(" ")
for index, value in enumerate(friend_height):
    friend_height[index] = int(value)

for i in friend_height:
    if i < acceptable_height:
        user_input -= 1
print(user_input)

Submission status: Accepted

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

for x in range(0, N):
    if(K<=h[x]):
        count+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b=map(int, input().split());print(len([i for i in map(int, input().split()) if i >= b]))

Submission status: Accepted

Solution code:
N = input().split()
h = input().split()
 
count=0
for x in h:
    if(int(x)>=int(N[1])):
        count+=1

print(count)

Submission status: Accepted

Solution code:
N, K = input().split()
N, K = int(N), int(K)
ls = []
count = 0
H = input()
ls = H.split()
for i in ls:
    if int(i) >= K:
        count += 1

print(count)

Submission status: Accepted

Solution code:
N = input().split()
i = input().split()

count=0
for j in i:
    if(int(j)>=int(N[1])):
        count+=1

print(count)

Submission status: Accepted

Solution code:
[n, k] = input().split()
heights = input().split()
if int(n) == len(heights):
  count = sum(1 for i in heights if int(i) >= int(k))
  print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

num_friends = 0
for h in hs:
    if h >= K:
        num_friends += 1

print(num_friends)