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

Submission status: Accepted

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

Submission status: Accepted

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

c =0

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
  n, t = [int(i) for i in input().split()]
  members = [int(i) for i in input().split() if int(i)>=t]
  print(len(members))
  

if __name__ == '__main__':
  solve()

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:
# https://atcoder.jp/contests/abc142/tasks/abc142_b
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
print(sum(i >= k for i in a))

Submission status: Accepted

Solution code:
INPUT = [input().split() for l in range(2)]
 
N=INPUT[0][0]
K=int(INPUT[0][1])
H=[int(s) for s in INPUT[1]]
 
n = sum(x>=K for x in H)
 
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
INPUT = [input().split() for l in range(2)]

N=INPUT[0][0]
K=int(INPUT[0][1])
H=[int(s) for s in INPUT[1]]

n = sum(x>=K for x in H)

print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
import queue
import re
import math
import functools

def s_raw():
    return input().rstrip("\r")

def int_raw():
    return int(input())


def ss_raw():
    return input().split()


def ints_raw():
    return list(map(int, ss_raw()))


INF = 1 << 29


def make1d_arr(n, val=INF):
    return [val for i in range(n)]


def make2d_arr(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]


def gcd(a, b):
    if(b == 0):
        return a
    return gcd(b, a % b)


def BFord(n,es):
    v_cost = [INF]*n
    v_cost[0] = 0
    for v in range(n*2):
        for e in es:
            frm = e[0]
            to = e[1]
            if v_cost[to] > v_cost[frm]+e[2]:
                v_cost[to] = v_cost[frm]+e[2]
                if v >= n:
                    v_cost[to] = -INF
        if v == n-1:
            prev = v_cost[:]
    v_cost = [-INF if prev[idx]!=v_cost[idx] else v_cost[idx] for idx in range(n)]
    return v_cost
    
def ZAlgo(s):
    l = len(s)
    A = [0]*l
    i =1
    j =0
    A[0]=l
    while i<l:
        while i+j<l and s[j] == s[i+j]:
            j+=1
        if j==0:
            i+=1
            continue
        A[i]=j
        k=1
        while (i+k<l) and (k+A[k]<j):
            A[i+k] =A[k]
            k+=1
        i+=k
        j-=k
    return A


def main():
    n,k = ints_raw()
    return sum([a>=k for a in ints_raw()])


if __name__ == "__main__":
    print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

for i in n:
  if int(i) >= k:
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
line = input()
n, k = [int(item) for item in line.strip().split(' ')]
line = input()
h = [int(item) for item in line.strip().split(' ')]

count = 0
for item in h:
    if item >= k:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_, l = map(int, raw_input().split())                                                                                                                                                     
h = list(map(int, raw_input().split()))

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

print cnt

Submission status: Accepted

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

x = 0
for hi in H:
    if hi >= K:
        x += 1
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
temp = input().split(" ")
k = int(temp[1])
height = input().split(" ")

count = 0
for person in height:
  if int(person) >= k:
    count += 1

print(count)

Submission status: Accepted

Solution code:
n,k=(int(x) for x in input().split())
h=list(map(int,input().split()))
a=0
for y in h:
  if k<=y:
    a+=1
print(a)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

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

Submission status: Accepted

Solution code:
num, lim = map(int, input().split())
x = map(int, input().split())
print(len([person for person in x if person >= lim]))

Submission status: Accepted

Solution code:
_, limit = map(int, raw_input().split())
ns = map(int, raw_input().split())

print len([n for n in ns if n >= limit])

Submission status: Accepted

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

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

count=0
for value in li:
  if value>=k:
    count+=1
    
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

count = 0
for height in height_list:
    if height >= k:
        count += 1

print("{}".format(count))

Submission status: Accepted

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

for f in friends:
  if f >= K:
    ret = ret + 1

print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

str_N, str_K = input().split()
height = input().split()

int_N = int(str_N)
int_K = int(str_K)

for i in range(len(height)):
    height[i] = int(height[i])

k = 0

for j in height:
    if j >= int_K:
        k += 1

print(k)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
hs = list(map(int, input().split()))
hs.sort()
result = 0
for i in range(N):
    if hs[i] >=K:
        result = N -i
        break
print(result)

Submission status: Accepted

Solution code:
inp1 = input().split()
height=input().split()
ridable=[i for i in height if int(i)>=int(inp1[1])]

print(len(ridable))

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

res = 0

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

ans = sum(y >= K for y in h)
print(ans)

Submission status: Accepted

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

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

lis = []
count = 0

lis = list(map(int,input().split()))
  
for height in lis:
  if height >= K:
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
#map(int, input().split())
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, r = map(int, input().split())
l = list(map(int, input().split()))
mem = 0
for i in range(len(l)):
    h = l[i]
    if h >= r:
        mem += 1
print(mem)

Submission status: Accepted

Solution code:
from collections import deque

n, k = map(int, input().split())
h = deque(list(input().split()))
ans = 0

while len(h) > 0:
    if int(h.pop()) >= k:
        ans += 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 range(n):
    if h[i] >= k:
        ans += 1

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#%%
a = input()
b = input()

#%%
N =  int(a.split()[0])
K = int(a.split()[1])
h = [int(x) for x in b.split()]

available_num = 0
for hight in h:
    if hight >= K:
        available_num += 1

print(available_num)
#%%

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    h = sorted(h, reverse=True)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

answer = sum(x >= k for x in h)

print(answer)

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 = [int(v) for v in input().split()]
nums = [int(v) for v in input().split()]
print(len([n for n in nums if n >= K]))

Submission status: Accepted

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

print(sum([1 for i in h if i >= K]))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

h.sort()
h.reverse()
count = 0
for i in h:
  if i >= K:
    count += 1
  else:
    break;
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for x in input().split():
  if int(x)>=K:
    cnt += 1

print(cnt)

Submission status: Accepted

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

ans=0
i=0
H = [int(x) for x in input().split()]
for i in (H):
    if i>=K:
        ans =ans+1
    
print(ans)

Submission status: Accepted

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

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:
import sys
n, k = map(int, sys.stdin.readline().split())
h = list(map(int, sys.stdin.readline().split()))
s = 0
for i in h:
  if i >= k:
    s+=1
print(s)

Submission status: Accepted

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

counter =0
for l_num in l:
    if l_num >= k:
        counter += 1
print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

Submission status: Accepted

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

print(count)
#print(li)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
H = [int(_) for _ in stdin.readline().rstrip().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())
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:



def main():


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

    for i in heigtList:
        if k <= i :
            count += 1
    print(count)



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = list(map(int, input().split(" ")))
print(sum(map(lambda x: 0 if int(x)<K else 1, input().split(" "))))

Submission status: Accepted

Solution code:
N, K = list(map(int, input().split(" ")))
h = sorted(list(map(int, input().split(" "))))
print(sum([0 if i<K else 1 for i in h]))

Submission status: Accepted

Solution code:
# coding: utf-8

N,limit = map(int, input().split())
height_list = list(map(int, input().split()))

cnt=0
for height in height_list:
    if(limit<=height):
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = 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()))

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

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

print(N - cnt)

Submission status: Accepted

Solution code:
#!/snap/bin/pypy3


def main():
    N, K = map(int, input().split())
    heights = list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8

n, k = map(int, input().split())
height = [int(s) for s in input().split()]

cnt = 0
for i in height:
    if i >= k:
        cnt += 1
        
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h_l = [int(_) for _ in input().split()]
print(len([x for x in h_l if x >= K]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for height in list:
    if height>=K:
        i+=1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(oppai)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
import collections
N, K = map(int, input().split())
h = list(map(int, input().split()))
assert( len(h) == N)
s = collections.Counter([hi >= K for hi in h])
print(s[True])

Submission status: Accepted

Solution code:
from sys import stdin

n, k = [int(x) for x in stdin.readline().rstrip().split()]

print(sum([1 for h in stdin.readline().rstrip().split() if int(h) >= k]))

Submission status: Accepted

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

Submission status: Accepted

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

print(num)

Submission status: Accepted

Solution code:
#142b
N,K = map(int, input().split()) #K<=100
h_list = list(map(int, input().split()))

#高橋君の仲間たちは N人で遊園地に遊びにいきました。
#遊園地の一番人気のジェットコースターに乗るためには、身長が K cm以上必要です。
#高橋君の i番目の仲間の身長は hi cm です。
#高橋君の仲間たちのうち、一番人気のジェットコースターに乗ることができる人の数を求めてください。

OK_h_list = [h_list[i] for i in range(N) if h_list[i]>=K]
print(len(OK_h_list))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N,K=map(int,input().split())
h=list(map(int,input().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 = list(map(int,input().split()))
result = 0
for h in H:
    if h >= K:
        result +=1
print(result)

Submission status: Accepted

Solution code:
n, k = map(int, input().split(" "))
hs = map(int, 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())
friend = [int(i) for i in input().split()]
print(len([i for i in friend if i >= k]))

Submission status: Accepted

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

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

print ans

Submission status: Accepted

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


def can_ride(n):
    return n >= K


print(len(list(filter(can_ride, heights))))

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

def minus(x):
    y = int(x)
    return y*(-1)

N , K = map(int,input().split())
h_list = list(map(minus,input().split()))
ans = 0
heapq.heapify(h_list)

for i in range(N):
    if (heapq.heappop(h_list)*(-1) < K):
        break

    else:
        ans += 1


print(ans)

Submission status: Accepted

Solution code:
import heapq

N , K = map(int,input().split())
h_list = list(map(int,input().split()))
ans = 0
heap = []

for i in range(N):
    heapq.heappush(heap, h_list[i]*(-1))

for i in range(N):
    if (heapq.heappop(heap)*(-1) < K):
        break

    else:
        ans += 1


print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for i in H:
    if i >= K:
        cnt += 1
print(cnt)

Submission status: Accepted

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
friend_num, required_height = map(int, input().split())
heights = list(map(int, input().split()))
passed_num = 0
for i in heights:
  if i >= required_height:
    passed_num += 1
print(passed_num)

Submission status: Accepted

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

T = 0
i = 0
while T == 0:
  if H[i] >= K:
    T = 1
  else:
    i += 1
    if i >= N:
      print(0)
      quit()
      
print(N - i)

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

print(ans)

Submission status: Accepted

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

L.sort()
for i in range(n):
      if L[i]>=k:
            print(n-i)
            exit()
print(0)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

res = 0
for j in member_lst:
    if j >= k:
        res += 1
print(str(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,Y= [int(i) for i in input().split()]
n = list(map(int, input().split()))
print(sum(x>=Y for x in n) )

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = 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()))

#hi=h[i-1]

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(len(h)):
  if h[i] >= K:
    count+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#atcorder beginner contest 142
#B roller coaster

person, limit_height = input().strip().split()
person = int(person)
limit_height = int(limit_height)


i = 0
can = 0
person_height = list(map(int, input().split()))

for i in person_height:
    if i >= limit_height:
        can += 1

print(can)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
from sys import stdin

N, K = map(int, stdin.readline().rstrip().split())
h = list(map(int, stdin.readline().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()))
from bisect import bisect_left
print(n - bisect_left(sorted(h),k))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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



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

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