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:
a=input().split(' ')
b=int(a[0])
c=int(a[1])
data=input().split(' ')
data_1=0
data_2=0
for i in range(b):
	data_1=int(data[i])
	if data_1 >= c:
		data_2=data_2+1
	else:
		pass
print(data_2)

Submission status: Accepted

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

Submission status: Accepted

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


print(len(H_hi))

Submission status: Accepted

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

Submission status: Accepted

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

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()))
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(N)

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
  else:
    count += 0

print(count)

Submission status: Accepted

Solution code:
def B_RollerCoaster():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    ans = len([h[x] for x in range(N) if K <= h[x] ])
    print(ans)
    
if __name__ == "__main__":
    B_RollerCoaster()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    N, K = map(int, input().split())
    people_hight = list(input().split())
    ok = 0

    for person_hight in people_hight:
        if K <= int(person_hight) :
            ok = ok + 1
    print(ok)

Submission status: Accepted

Solution code:
A=list(map(int,input().split()))
B=list(map(int,input().split()))
count=0
for b in B:
    if A[1]<=b:
        count+=1
print(count)

Submission status: Accepted

Solution code:
import numpy as np
result = 0
N = list(map(int, input().split())) 
A = list(map(int, input().split())) 

for i in range(N[0]):
    p1 = A[i]
    if p1 >= N[1]:
        result +=1
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=[int(i) for i in input().split()]
p = list(map(int,input().split()))
import numpy as np
p=np.array(p)
D=p-k
print(np.count_nonzero(D>=0))

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

x = input().split()

x1 = int(x[0])
x2 = int(x[1])

y = input().split()

count = 0
for n in y:
    if int(n) >= x2:
        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(0, n):
  if h[i] >= k:
    cnt +=1
print(cnt)

Submission status: Accepted

Solution code:
N,K = list(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:
import numpy as np

n, k = map(int, input().split())
h = list(map(int, input().split()))
a = np.array(h)
print(np.sum(a >= k))

Submission status: Accepted

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

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:
#ABC142_B
N,K = map(int,input().split())
L = list(map(int,input().split()))
count = 0
for i in range(N):
    if L[i] >= K:
        count += 1
print(count)

Submission status: Accepted

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

h.sort(reverse=True)
flag = True
if h[n-1]>k:
	ans = n
	flag = False
elif h[0] < k:
	ans = 0
	flag = False
#k==max(h)とk==min(h)と合致する場合の分岐がなく、ans=0になっていた
elif h[n-1]==k:
	ans = n
elif h[0]==k:
	ans = h.count(h[0])
if flag == True:
	for i in range(0,n):
		if h[i] < k:
			ans = len(h[0:i])
			break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, K = input().split()
N = int(N)
K = int(K)
a = input().split()
ans = 0

ans = sum(1 for x in a if int(x) >= K)
		
print(ans)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h_list = list(map(int, 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())
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:
import numpy as np

a = list(map(int, input().split()))
N = a[0]
K = a[1]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def _input():
    array = input().split()
    # 人数と身長
    return int(array[0]), int(array[1])

def input_heights():
    array = input().split()
    array_as_int = []

    for i in array:
        array_as_int.append(int(i))
    return array_as_int

def result(array, limit):
    counter = 0
    for i in array:
        if limit <= i:
            counter += 1
    return counter


if __name__ == "__main__":
    number, height = _input()
    heights_array = input_heights()
    print(result(heights_array, height))

Submission status: Accepted

Solution code:
data = raw_input().split()
n, size = int(data[0]), int(data[1])
data = raw_input().split()
res = 0
for i in data:
    if (int(i) >= size):
        res +=1

print(res)

Submission status: Accepted

Solution code:
# coding: utf-8

def solve(arg: str) -> str:
    NK, H = arg.split('\n')
    n, k = map(int, NK.split())
    ar_H = map(int, H.split())
    return str(sum(k <= int(h) for h in ar_H))


if __name__ == "__main__":
    print(solve('\n'.join([input() for _ in range(2)])))

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
h = list(map(int,input().split()))
n = a[0]
k = a[1]
i=1
ans=0
while i <= n:
    if h[i-1] >= k:
        ans = ans+1
    i = i+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 K<=h[i]:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
N = a[0]
K = a[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

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:

x = input()
hights_str = input()

low_limit = int(x.split(" ")[1])
hights = map(int, hights_str.split(" "))

count = 0
for hight in hights:
    if hight >= low_limit:
        count += 1

print(count)

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:
def F(x):
    global K
    if K <= x:
        return x
N,K=map(int,input().split())
H=list(map(int,input().split()))
H=list(filter(F,H))
print(len(H))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

_N, K = tuple(input().split(" "))
heights = np.array(
    input().split(" "),
    dtype=np.int64
)

print(
    len(heights[heights >= int(K)])
)

Submission status: Accepted

Solution code:
j = 0
a = 0
i = 0
N,K=(int(x) for x in input().split())
h = [int(x) for x in input().split()]
"""j = 0
a = 0
i = 0"""
for i in range(N):
    if h[i]>=K:
        a = a+1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#question2
N, K = input().split()
h = input().split()

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

print(len(h_ok))

Submission status: Accepted

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

Submission status: Accepted

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

r = 0
for h in hs:
    if h >= K:
        r += 1
print(r)

Submission status: Accepted

Solution code:
n, k = [int(x) for x in input().split(' ')]
friends = [int(x) for x in input().split(' ')]
count = 0
for friend in friends:
    if friend >= k:
        count += 1
print(count)

Submission status: Accepted

Solution code:

import numpy as np
import sys
sys.setrecursionlimit(100000)

directions = np.array([[1, 0], [0, 1], [-1, 0], [0, -1]])


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


sys.setrecursionlimit(100000)


directions = [[1, 0], [0, 1], [-1, 0], [0, -1]]
directions = list(map(np.array, directions))


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


N, K = acinput()
h = np.array(acinput())

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
n,m = map(int,input().split())
s = list(map(int,input().split()))
c = 0
for i in range(n):
    if s[i] >= m:
        c += 1

print(c)

Submission status: Accepted

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

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():

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


if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

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

ans = 0

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

print('{}'.format(ans))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
ans = 0
h.sort()
for i, l in enumerate(h):
    if l >= K:
        ans = len(h) - i
        break

print(ans)

Submission status: Accepted

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

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

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

print(a)

Submission status: Accepted

Solution code:
N, K = (int(x) for x in input().split())

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

ride_member = 0
for height in h:
  if height >= K:
    ride_member += 1
  else:
    ride_member += 0

print(ride_member)

Submission status: Accepted

Solution code:
N,C = map(int,input().split())
array = list(map(int,input().split()))
ans=0
for i in array:
  if i>= C:
  	ans+=1
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
sin = input()
aa = list(map(int, sin.split()))
sin = input()
bb = list(map(int, sin.split()))

n = aa[0]
k = aa[1]

cc = list(map(lambda x: x >= k, bb))
print(cc.count(True))

Submission status: Accepted

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

h = input().split()

c = 0
for a in h:
    if int(a) >= k:
        c +=1

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(np.sum(H >= K))

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 = list(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 = [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:
import sys
input = sys.stdin.readline

#複数入力
n,k=(int(x) for x in input().split())

#リスト入力
h = [int(i) for i in 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()))
s=0
for i in h:
  s+=1 if i >= K else 0
print(s)

Submission status: Accepted

Solution code:
rule = input().split()
men = input().split()

mens = 0
for i in men:
  if int(rule[1]) <= int(i):
    mens += 1

print(mens)

Submission status: Accepted

Solution code:
a,b = map(int,input().split())
l = list(map(int,input().split()))

s = 0
for n,x in enumerate(l):
        if x>=b:s+=1
print(s)

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:
human_number, rest_high = map(int,input().split())
human = input()
human_list = human.split()
count = 0
for i in range(0,human_number):
    if int(human_list[i]) >= rest_high:
        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+=1
print(ans)

Submission status: Accepted

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

B = 0

for z in range(n):
    if int(a[z]) >= k:
        B += 1

print(B)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n, k = map(int, input().split())
list = list(map(int, input().split()))
ans = 0
for n_i in range(0, n):
    if list[n_i] >= k:
        ans += 1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N,K = [int(i) for i in input().split(" ")]

N = np.array([int(i) for i in input().split(" ")])

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

Submission status: Accepted

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

list = map(int, input().split())
i = 0
for x in list:
    if(x >= K):
        i+=1
print(i)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
input1 = input()
hight_list = list(map(int, input().split()))
(person_num, hight_limit) = list(map(int, input1.split()))

cnt = 0
for i in hight_list:
  if i >= hight_limit:
    cnt = cnt + 1

print(cnt)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
b=list(map(int,input().split()))

print(len([i for i in b if i>=a[1]]))

Submission status: Accepted

Solution code:
import numpy as np
N, K = [int(i) for i in input().split()]
arr_h = np.array([int(i) for i in input().split()])
arr_judge = arr_h >= K
print(sum(arr_judge))

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for i in mem:
  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()]

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

Submission status: Accepted

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

if 1 <= N <= 10**5 and 1 <= K <= 500:
    pass
else:
    INPUT_1 = input()
    N, K = INPUT_1.split()
    N = int(N)
    K = int(K)

INPUT_2 = list(map(int, input().split()))
if len(INPUT_2) == N:
    pass
else:
    INPUT_2 = list(map(int, input().split()))

count = 0
for i in range(len(INPUT_2)):
    if INPUT_2[i] >= K:
        count += 1
    else:
        pass
print(count)

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
  else:
    ans += 0
print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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:
a,b=(int(x) for x in input().split())
X=input()
Y=X.split()
count=0

for i in range(len(Y)):
    if b<=int(Y[i]):
        count=count+1
    ++i
print(count)

Submission status: Accepted

Solution code:
NK = input().split(" ")
N = int(NK[0])
K = int(NK[1])
H = list(map(int,input().split(" ")))
result = 0

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

print(result)

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

Submission status: Accepted

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

h.sort()
#print(h)

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


print(N-i-1)

Submission status: Accepted

Solution code:
n, k, *h = map(int, open(0).read().split() )
print( sum( [1 for height in h if height>=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:
n,k=(int(x) for x in input().split())
h_list=list(map(int,input().split()))
counter=0
for i in range(n):
    if h_list[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 i in range(N):
	if int(h[i]) >= K :
		ans += 1

print(ans)

Submission status: Accepted

Solution code:
x,y = map(float,input().split())	
li = list(map(float,input().split()))	
count=0
for i in li:
    if(y <= i):
        count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

ans = N
for i in range(N):
    if h[i] < K:
        ans = i
        break
print(ans)

Submission status: Accepted

Solution code:
import sys

n, k = map(int, raw_input().split(" "))
h = sorted(map(int, raw_input().split(" ")), reverse=True)

l = 0
r = len(h)-1
i = -1
while l<=r:
    i = (l+r)/2
    if k > h[i]:
        r = i-1
    elif k < h[i]:
        l = i+1
    else:
        break

while i<len(h) and h[i] >= k:
    i += 1

print i

Submission status: Accepted

Solution code:
a = []
a = input().split()
N = int(a[0])
K = int(a[1])

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

count = 0

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

#print('(N, K) = (', N,', ', K, ')')
#print('h = ', h)

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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 = list(map(int,input().split()))
array = list(map(int,input().split()))
ans = 0
i = 0
while N > i:
  if array[i] >= K:
    ans += 1
    
  i += 1
print(ans)

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 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:
n,k=[int(s) for s in input().split()]
h_list=list(map(int,input().split()))

number=0

for i in h_list:
	if i >= k:
		number=number+1
	else:
		pass

print(number)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A = input().split()
B = input().split()
member = 0
count = 0
for i in B:
    if int(i) >= int(A[1]):
        count += 1
    member += 1
    if int(member) >= int(A[0]):
        break

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K = map(int, raw_input().split())
H = map(int, raw_input().split())
A = sum([1 for h in H if h >= K])
print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input().split()

n = int(str[0])
k = int(str[1])

str2 = input().split()

c = 0

for s in str2:
    i = int(s)
    if i >= k:
        c += 1

print(c)

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

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

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:
tmp = input().split()
N = int(tmp[0])
K = int(tmp[1])
h = input().split()

count = 0
for i in h:
    if int(i) >= K:
        count += 1
    # print(i)
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
member=list(map(lambda x:int(x)>=K,input().split()))
print(member.count(True))

Submission status: Accepted

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

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

t = sum(x>=K for x in a)
print(t)

Submission status: Accepted

Solution code:
import numpy as np
N = list(map(int, input().split()))
A = list(map(int, input().split())) 
numb = N[0]
bord = N[1]

A_p =np.array(A)
count =0

for n in range(numb):
    if A_p[n] >= bord:
        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 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()))
total = 0
for i in range(N):
  if h[i] >= K:
    total += 1
print(int(total))

Submission status: Accepted

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

def Roller_Coaster(N, K, member):
        a = list(filter(lambda x: x >= K, member))
        return len(a)

if __name__ == "__main__":
    [N, K] = list(map(int, input().split()))
    member = list(map(int, input().split()))
    print(Roller_Coaster(N,K,member))

Submission status: Accepted

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

Submission status: Accepted

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

list= [n for n in li if n>=k]

print(len(list))

Submission status: Accepted

Solution code:
n,k = input ().split(' ')

n = int(n)

k = int(k)

canRide = 0

friends = input().split(' ')

for i in range (n):
    if int(friends[i]) >= k:
        canRide += 1

print(canRide)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import os

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

hs = sorted(h)

s = 0

for i in range(n):
    if hs[i] >= k:
        break
    else:
        s += 1

print(n - s)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n, k = (int(i) for i in input().split())
h = np.array([int(i) for i in input().split()])
print(sum(h >= k))

Submission status: Accepted

Solution code:
line_01 = input().split(" ")
line_02 = input().split(" ")

N = int(line_01[0])
K = int(line_01[1])
count = 0

for i in line_02:
  if int(i) >= K:
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()

n,k =na()
h =na()
h = sorted(h)

import bisect

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