Problem:


Score : 200 points

Problem Statement

N friends of Takahashi has come to a theme park.

To ride the most popular roller coaster in the park, you must be at least K centimeters tall.

The i-th friend is h_i centimeters tall.

How many of the Takahashi's friends can ride the roller coaster?

Constraints

 1 \le N \le 10^5 

 1 \le K \le 500 

 1 \le h_i \le 500

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
h_1 h_2 \ldots h_N

Output

Print the number of people among the Takahashi's friends who can ride the roller coaster.

Sample Input 1

4 150
150 140 100 200

Sample Output 1

2

Two of them can ride the roller coaster: the first and fourth friends.

Sample Input 2

1 500
499

Sample Output 2

0

Sample Input 3

5 1
100 200 300 400 500

Sample Output 3

5



Sample input:
4 150
150 140 100 200


Sample output:
2

Submission status: Accepted

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

for i in h:
    if i >= k:
        cnt += 1
    else:
        break
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,limit = map(int,input().split())
tall_list = list(map(int, input().split()))
#print(tall_list[2],type(tall_list))
n=0
for i in tall_list:
    if i>=limit:n+=1

print(n)

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+=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:
K = int(input().split(' ')[1])
h_list = list(map(int, input().split(' ')))
print(sum([1 if h>=K else 0 for h in h_list]))

Submission status: Accepted

Solution code:
N, K = map(int, input().split(' '))
h_list = list(map(int, input().split(' ')))
print(sum([h>=K for h in h_list]))

Submission status: Accepted

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


def filter_height_by_K(x):
    return x >= K


def solve(N, H):
    ride_list = list(
        filter(filter_height_by_K, H)
    )
    return len(ride_list)


print(solve(N, H))

Submission status: Accepted

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

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

Submission status: Accepted

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

res = 0
for i in lst:
    if i >= k:
        res += 1
print(res)

Submission status: Accepted

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

num = [x for x in persons if x >= K]
print(len(num))

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 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())
print(sum(i>=K for i in H))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
H = 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 = [int(x) for x in input().split()]
num = 0

for i in h:
    if i >= K:
        num += 1
print(num)

Submission status: Accepted

Solution code:
import copy

def j(n):
    if n:print("yes")
    else:print("no")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

n,k = ips()
a = iprow()
s = 0
for i in a:
    if i>=k:s+=1
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

hlist.sort(reverse=True)
ans=0
for h in hlist:
  if h>=K:
    ans+=1
  else:
    break
    
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

n, k = map(int, input().split())
heights = np.array(input().split(), dtype='int')

ans = 0

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

print(ans)

Submission status: Accepted

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

count = 0
for elem in elems:
	if(elem>=k):
		count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(sum(k <= h for h in hs))

Submission status: Accepted

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

print(counter)

Submission status: Accepted

Solution code:
import sys
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split()) 
DBG = True # and False

def ddprint(x):
  if DBG:
    print(x)


n,k = inm()
h = inl()
sm = 0
for i in range(n):
  if h[i]>=k:
    sm += 1
print(sm)

Submission status: Accepted

Solution code:
n,l = [int(x) for x in input().split()]
h = map(lambda x:x-l, list(map(int, input().split())))
print(sum(x>=0 for x in h))

Submission status: Accepted

Solution code:
import sys,os,math
from collections import Counter, defaultdict, deque
import bisect
from sys import stdin, stdout
from itertools import repeat


# sys.stdin = open('input')
# n, k = map(int, raw_input().split())
# da = map(int, raw_input().split())
# db = map(int, raw_input().split())


def solve():

    pass

def main():
    n, k = map(int, raw_input().split())
    da = map(int, raw_input().split())
    print len(filter(lambda x:x>=k, da))



main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import bisect

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

Submission status: Accepted

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

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

cou = 0
for i in h:
    if K<=i:
        cou+=1
print(cou)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h, reverse=True)
for i, h_i in enumerate(h):
  if h_i >= K:
    continue
  else:
    print(i)
    exit()

print(N)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k = input().split()
n = int(n)
k = int(k)
#n人数
#k身長制限
ans = 0

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

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

print(ans)

Submission status: Accepted

Solution code:
# 1行目の入力を空白で分割された数値として扱う
n, k = map(int, input().split())
# 2行目の入力を数値のリストとして扱う
h = list(map(int, input().split()))

# 答えのカウンタの準備
cnt = 0

# k以上のhを数える
for i in range(0, n):
    if h[i] >= k:
        cnt += 1

# 答えの出力
print( cnt )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  n,k = map(int,input().split())
  h = [int(x) for x in input().split()]
  cnt = 0
  for i in range(n):
    if h[i]>=k:
      cnt +=1
    else:
      pass
  print(cnt)
if __name__ == "__main__":
  main()

Submission status: Accepted

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

c = 0


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def t(k, h):
    return len([i for i in h if i >= k])


if __name__ == "__main__":
    n, k = map(int, input().split())
    h = map(int, input().split())
    print(t(k, h))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(ans))

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

Solution code:
import bisect
n,k = input().strip().split()
n,k = [int(n),int(k)]
array = list(map(int,input().strip().split()))
array.sort()
index = bisect.bisect_left(array,k)
print (n - index)

Submission status: Accepted

Solution code:
nk = input()

num, needh = map(int, nk.split())

heights = input()

count = 0

heightsNum = heights.split()

for i in range(0, len(heightsNum), 1):

    height = int(heightsNum[i])
    if height >= needh:
        count += 1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

_n, _k = map(int, input().split())
hlist = [item for item in map(int, input().split())]

crlist = [item for item in hlist if item >= _k]
print(len(crlist))

Submission status: Accepted

Solution code:
# coding: utf-8
n, k = map(int, input().split())
h_list = list(map(int, input().split()))
print(len([h for h in h_list if h >= k]))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# %%
import sys


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


# 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]"
    print(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()))

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

Submission status: Accepted

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

print(sum( y >= int(k) for y in x))

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

Submission status: Accepted

Solution code:
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))

Submission status: Accepted

Solution code:
m = list(map(int,input().split()))
N = m[0]
K = m[1]
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 = [int(x) for x in input().split(" ")]
arr = [int(x) for x in input().split(" ")]

count = 0
for a in arr:
	if a >= K:
		count += 1
print(count)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
c = len(list(filter(lambda x: x >= K, h)))
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())
hight = [int(i) for i in input().split()]
ans = 0
for i in hight:
  if i >= k:
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    h = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for i in range(n):
        if h[i] >= k:
            cnt += 1
    print(cnt)


if __name__ == '__main__':
    slove()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i = [hi for hi in h if int(hi) >= int(K)]
  
print(len(i))

Submission status: Accepted

Solution code:
N,K = (int(x) for x in input().split())
h = []
count = 0
for x in input().split():
    h.append(int(x))
for x in h:
    #print(x)
    if x >= 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 += 1
print(ans)

Submission status: Accepted

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


n = len([1 for x in friends if x>=K])

print(n)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

n, k = [int(each) for each in input().split(' ')]
h = input().split(' ')
heights = np.array([int(each) for each in h])
out = np.where(heights >= k)
print(len(out[0]))

Submission status: Accepted

Solution code:
n, k = [int(each) for each in input().split(' ')]
h = input().split(' ')
heights = [int(each) for each in h]
cnt = 0
for height in heights:
    if height >= k:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
n,k=[int(k) for k in input().split()]
h_array=[int(k) for k in input().split()]
h_array.sort(reverse=True)

ans=0
for i in range(len(h_array)):
    if h_array[i]>=k:
        ans+=1
    else:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    #入力
    [n, k] = [int(i) for i in input().split()] 
    h = [int(i) for i in input().split()] 

    print(len(able_ride_jet(k, h)))


def able_ride_jet(const, heights):
    """ ジェットコースターに乗れる人の身長のリストを返す関数
    """
    return list(filter(lambda x: x >= const, heights))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

def able_ride_jet(const, heights):
    """ ジェットコースターに乗れる人の身長のリストを返す関数
    """
    return list(filter(lambda x: x >= const, heights))

print(len(able_ride_jet(k, h)))

Submission status: Accepted

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

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

counter = 0

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

print(counter)

Submission status: Accepted

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

ans=0
for i in list_h:
  if K<=i:
    ans+=1
print(ans)

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in h:
    if i < K:
        N -= 1
print(N)

Submission status: Accepted

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

h.sort(reverse=True)
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()))

a = []

for b in h:
  if b >= k:
    a.append(b)

print(len(a))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    n = II()
    ans = 0
    for i in range(1, n + 1):
        ans += i & 1
    print(ans/n)
    return

#B
def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        ans += i >= k
    print(ans)
    return

#C
def C():
    n = II()
    a = LI()
    d = defaultdict(int)
    for i in range(n):
        d[a[i] + 1] = i + 1
    for _, v in sorted(d.items()):
        print(v, end=" ")
    print()
    return

def primes(n):
    """ Input n>=6, Returns a list of primes, 2 <= p < n """
    """ 6以上の数であれば p (素数) <= n のlistを返す """
    n, correction = n-n%6+6, 2-(n%6>1)
    sieve = [True] * (n//3)
    for i in range(1,int(n**0.5)//3+1):
        if sieve[i]:
            k=3*i+1|1
            sieve[      k*k//3      ::2*k] = [False] * ((n//6-k*k//6-1)//k+1)
            sieve[k*(k-2*(i&1)+4)//3::2*k] = [False] * ((n//6-k*(k-2*(i&1)+4)//6-1)//k+1)
    return [2,3] + [3*i+1|1 for i in range(1,n//3-correction) if sieve[i]]

#D
def D():
    a, b = LI()
    p = primes(int(math.sqrt(max(a, b))) + 1)
    ans = 1
    for i in p:
        if a % i == b % i == 0:
            ans += 1
    print(ans)
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
k = int(input().split(" ")[1])
c = 0
for e_h in [int(e) for e in input().split()]:
    if(k <= e_h): c += 1
print(c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
h=list(map(int,input().split()))
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
h.sort(reverse = True)
for cm in h:
    if cm < K:
        break
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
N = [int(i) for i in input().split()]
count = 0

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

ans = 0
for i in range(n):
  if a[i] >= m:
    ans += 1

print(ans)

Submission status: Accepted

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

num = 0
for hei in h:
	if(hei >= K):
		num+=1
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

c = 0
for i in HI:
  if i >= H:
    c += 1

print(c)

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 i in h:
  if i >= K:
    ans += 1

print(ans)

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
h_array = sorted([int(x) for x in input().split()])
cnt = 0
for h in h_array:
    if h >= k:
        print(n - cnt)
        exit()
    cnt += 1
else:
  print(n-cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for height in user:
    if height >= K:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n, k = input().split()
n = int(n) #友人の数
k = int(k) #基準の高さ
h = input().split()
result = 0
#各人の身長を基準の高さと比較
for i in range(n):
  if k <= int(h[i]):
    result += 1
  else:
    result -= 0
print(result)

Submission status: Accepted

Solution code:
num, jet = map(int, input().split())

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

ans = 0

for n in height:
    if n >= jet:
        ans += 1

print(ans)

Submission status: Accepted

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

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

result = 0
for i in range(N):
  result += l[i] >= K

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

h.sort()

ans = N

for i in h:
    if i >= K:
        break
    ans -= 1


print(ans)

Submission status: Accepted

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

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(N: int, K: int, h: "List[int]"):
    print(len(list(filter(lambda i: i >= K, h))))
    return


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

Submission status: Accepted

Solution code:
import sys
import math
input = sys.stdin.readline

N, K = (int(i) for i in input().split())
hs = [int(i) for i in input().split()]
count = 0
for h in hs:
    if h >= K:
        count += 1

print(count)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
target_list = [ height for height in input().split() if k <= int(height) ]

print(len(target_list))

Submission status: Accepted

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