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:
from sys import stdin

data = [stdin.readline().rstrip().split() for _ in range(2)]
N, K = [int(n) for n in data[0]]
H = [int(n) for n in data[1]]
cnt = 0
for i in H:
    if i >= K:
        cnt = cnt + 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

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())
a = list(map(int,input().split()))
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 = list(map(int, input().split()))
h_list.sort()
for i in range(N):
    if h_list[i] >= K:
        print(N-i)
        exit(0)
print(0)

Submission status: Accepted

Solution code:
import numpy as np
i8 = np.int64
i4 = np.int32

def main():
    stdin = open('/dev/stdin')
    N, K= map(int, stdin.readline().split())
    h = np.fromstring(stdin.readline(), i8, sep=' ')
    ans = np.count_nonzero(h >= K)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

n,k=get_ints()
Arr=get_array()
count=0
for i in Arr:
  if i>=k:
    count+=1
print(count)

Submission status: Accepted

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

for i in li:
    if int(i)>=k:
        an+=1

print(an)

Submission status: Accepted

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

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

count = 0

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

print(count)

Submission status: Accepted

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

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())
height = [int(i) for i in input().split()]
num = 0
for i in  height:
    if i >= K:
        num = num+1
print(num)

Submission status: Accepted

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

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

for h in h_l:
    if h >= 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 hi in h:
    if hi>=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:
def inpl(): return list(map(int, input().split()))

N, K = inpl()
H = inpl()
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()))

# print(n, k, h)
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()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for height in h:
  if height >= k:
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np

    
##################################################################

if __name__ == "__main__":
    Input1 = [input() for i in range(2)]
    N,K = list(map(int,Input1[0].split()))
    h = list(map(int,Input1[1].split()))

    A = [h[i]>=K for i in range(N)]
    print(sum(A))
    #print(''.join(map(str,S[i])))

Submission status: Accepted

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

sumh=0

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

print(sumh)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
stdin = [int(i) for i in input().split()]
n = stdin[0]
k = stdin[1]
h = [int(i) for i in 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()))
x = 0
for i in range(n):
    if h[i] >= k:
        x += 1
print(int(x))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys
def input() -> str:
    return sys.stdin.readline()
n, k = map(int, input().split())
h = list(map(int, input().split()))
print(sum(hi >= k for hi 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:
import numpy as np

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

h.sort()
h_np = np.array(h)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,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 = 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(int(i) for i 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())
l=list(map(int, input().split()))
print(sum([1 for x in l if x>=k]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

noreru = 0
for l in h:
    if l >= k:
        noreru +=1


print(noreru)

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

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import bisect
import sys
import logging
import heapq
logging.basicConfig(level=logging.DEBUG)

input = sys.stdin.readline

setrecursionlimit(1000000)

MOD = 10**9+7

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

main()

Submission status: Accepted

Solution code:
import sys
N, K = sys.stdin.readline().strip().split()
h = list(map(int, sys.stdin.readline().strip().split()))

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
for n in nums:
  if n >= k:
    count +=1
  else:
    continue
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:
N, K = map(int,input().split())
H = list(map(int,input().split()))

H.sort(reverse=True)

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = [int(i) for i in input().split()]
cnt = 0
for i in input().split():
  if m <= int(i):
    cnt+=1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    _, k, *h = map(int, open(0).read().split())
    c = map(lambda x: 1 if x>=k else 0, h)
    print(sum(c))

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 H:
  if i >= K:
    cnt += 1

print(cnt)

Submission status: Accepted

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

list = [ 1 for h in input().split() if k <= int(h) ]

print(len(list))

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
cnt=0
for i in range(n):
	if h[i]>=k:
		cnt=i
		break
ans=n-cnt
if k<h[0]:
	ans=n
elif h[-1]<k:
	ans=0
print(ans)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
ans=n
for i in range(n):
    if h[i]>=k:
        ans=i
        break
if n-ans>=0:
    print(n-ans)
else:
    print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, K = map(int, input().split())
h_list = list(map(int, input().split()))

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

print(ans)

Submission status: Accepted

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

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())
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()))
h.sort(reverse=True)
cnt = 0
for height in h:
    if height < k:
        break
    cnt+=1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

n, k = na()
h = na()
c = 0
for hi in h:
    if hi >= k:
        c += 1

print(c)

Submission status: Accepted

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

count=0
for i in h_lis:
    if i>=k:
        count+=1
print(count)

Submission status: Accepted

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(1 for hi in h if hi >= K))

Submission status: Accepted

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

count = 0

for friend in friends:
  if friend >= k:
    count += 1
    
print(count)

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:
import bisect

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

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()))
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 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 = map(int, input().split())
H = sorted(list(map(int, input().split())))
over = -1
for i in range(n):
    if H[i]>=k:
        over = i
        break
if over < 0:
    print(0)
else:
    print(n-over)

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

Submission status: Accepted

Solution code:
n, k = (int(x) for x in 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())
s = list(map(int, input().split()))
a = 0
for i in s:
  if i >= k:
    a+= 1
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)

# input = sys.stdin.readline


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

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

    count = 0

    for h in heights:
        if h >= k:
            count += 1

    print(count)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def cnt(H,limit):
    if H>=limit:
        return 1
    else:
        return 0

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

ans = 0
for i in h:
    ans += cnt(i,K)

print(ans)

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

Submission status: Accepted

Solution code:
n, k = map(int,input().split())
height_li = list(map(int,input().split()))
ans = 0
for i in height_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()))
h = sorted(h, reverse=True)
ans = 0
for i in h:
    if i >= k:
        ans += 1
    else:
        break
print(ans)

Submission status: Accepted

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

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

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

print(count)

Submission status: Accepted

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

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

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())
heights = list(map(lambda n: int(n), input().split()))
ok_ppl = 0

for h in heights:
    if h >= K: ok_ppl += 1

print(ok_ppl)

Submission status: Accepted

Solution code:
_,k = map(int, input().split())
h = list(map(int, list(input().split())))
print(sum(map(lambda x : x>=k, h)))

Submission status: Accepted

Solution code:
def myinput(rownum):
    res = []
    for i in range(rownum):
        temp = input().split(" ")
        res += temp
    return res

def main():
    r = myinput(2)
    n = r[0]
    k = r[1]
    h = r[2:]
    count = 0
    for i in h:
        if int(i) >= int(k):
            count += 1
    print(count)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

heights = input().split(" ")
result = 0
for h in heights:
    if int(h) >= K:
        result += 1

print(result)

Submission status: Accepted

Solution code:
N, K = map(int, input().split()) 
h = list(map(int, input().strip().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=[int(i) for i in input().split()]
print(sum(i>=k for i in l))

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:
# 111
N, K = [int(item) for item in input().split()]
h_list = [int(item) for item in input().split()]

cnt = 0

for hight in h_list:
    if hight >= K:
        cnt += 1
        
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-                                                         
# スペース区切りの整数の入力                                                    
b, c = map(int, input().split())
h = input().split()
count = 0
for item in h:
    height = int(item)
    if height >= c:
        count += 1

print(count)

Submission status: Accepted

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

ans = 0
for i in range(N):
  if hs[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:
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 = 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(i) for i in input().split()]
H = [int(i) for i in input().split()]
print(len([1 for h in H if h >= K]))

Submission status: Accepted

Solution code:
n,k=list(map(int,input().split()))
h=list(map(int,input().split()))
ans=0
for i in range(len(h)):
  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()))

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

print(i)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
lista = [int(i) for i in input().split()]
ans=0
for i in range(n):
    if lista[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:
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(map(int,input().split()))
ret = 0
for hi in h:
    if(hi >= K):
        ret += 1
print(ret)

Submission status: Accepted

Solution code:
#coding: UTF-8
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()))

ans = 0

for i in h:
    if K <= 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 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()))
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())
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()))

count = 0

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

print(count)

Submission status: Accepted

Solution code:
from bisect import bisect_left
n,h=map(int,input().split())
arr=list(map(int,input().split()))
arr.sort()
print(n-bisect_left(arr,h))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
_,k = map(int, input().split())
print(sum(1 for h in map(int, input().split()) if 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=c+1

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding:utf-8
n, k= map(int, input().split())
h = list(map(int, input().split()))

hs = sorted(h, reverse=True)
count = 0

for member in hs:
    if member >= k:
        count += 1

print(count)

Submission status: Accepted

Solution code:
N,K = map(int, input().split())
H = list(map(int, input().split()))
H.sort(reverse=True)
count = 0
for h in H:
    if  h < K:
        break
    else:
        count += 1
print(count)

Submission status: Accepted

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

ans = len([n for n in nums if n >= K])
print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n, k = map(int, input().split())
h = list(map(int, input().split()))
count = 0
for hi in h:
    if hi >= k:
        count += 1
print(count)

Submission status: Accepted

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

r=[s for s in h if s >= k]

print(len(r))

Submission status: Accepted

Solution code:
import sys

N,K=map(int,sys.stdin.readline().split())
hList=list(map(int,sys.stdin.readline().split()))

canRide=0
for h in hList:
  if h >= K:
    canRide+=1
    
print(canRide)