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:
# abc142_b.py
# https://atcoder.jp/contests/abc142/tasks/abc142_b

# B - Roller Coaster /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 200点

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

# 制約
#     1≤N≤105
#     1≤K≤500
#     1≤hi≤500
#     入力はすべて整数

# 入力
# 入力は以下の形式で標準入力から与えられる。
# N K
# h1 h2 … hN

# 出力
# 高橋君の仲間たちのうち、一番人気のジェットコースターに乗ることのできる人の数を出力してください。

# 入力例 1
# 4 150
# 150 140 100 200

# 出力例 1
# 2

# 一番人気のジェットコースターに乗ることができるのは、1番目の仲間と 4 番目の仲間の 2人です。

# 入力例 2
# 1 500
# 499

# 出力例 2
# 0

# 入力例 3
# 5 1
# 100 200 300 400 500

# 出力例 3
# 5


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    N, K = list(map(int, lines[0].split()))
    values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    cnt = 0

    for value in values:
        if value >= K:
            cnt += 1

    return [cnt]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['4 150', '150 140 100 200']
        lines_export = [2]
    if pattern == 2:
        lines_input = ['1 500', '499']
        lines_export = [0]
    if pattern == 3:
        lines_input = ['5 1', '100 200 300 400 500']
        lines_export = [5]
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(2)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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()))
h = sorted(h)

line = 0
bool1 = False
for i in range(N):
  if h[i] >= K:
    line = i
    bool1 = True
    break

if bool1:
  print(N-i)
else:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = 1
# t = input()
# t = int(t)
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	n,k = map(int,input().strip().split())
	v = list(map(int,input().strip().split()))[0:n]
	# m = {}
	ans = 0
	for i in v:
		if i >= k:
			ans += 1
		# temp = x/i
		# if(x%i != 0):
		# 	temp += 1
		# m[i] += 1
	# ans = 0
	print(ans)
	# rem = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

if not ( 1 <= N <= 10**5 and 1 <= K <= 500 ): sys.exit()

count = 0
for I in array_hight:
    if not ( 1 <= I <= 500): sys.exit()
    if I >= K:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
N, K = map(int, input().split())
Nlist = list(map(int, input().split()))
Nlist.sort()
okindex = bisect.bisect_left(Nlist, K)
print(N-okindex)

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import bisect

n, k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()
i = bisect.bisect_left(h, k)
print(n-i)

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

n,k=mp()
h=lmp()
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()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import defaultdict, deque
from bisect import bisect_left

(n, k), s = map(int, input().split()), sorted(list(map(int, input().split())))
print(len(s[bisect_left(s, k):]))

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:
A,B=map(int,input().split())
N = list(map(int,input().split()))

c=0

for i in range(A):
  if N[i] >= B:
    c+=1
  else:
    pass
  i+=1
print(c)

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

Submission status: Accepted

Solution code:
#B
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 sys

def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり

N,K = LI()
h = LI()

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

print(ans)

Submission status: Accepted

Solution code:
# Coding is about expressing your feeling, and
# there is always a better way to express your feeling_feelme
import sys
import math
# sys.stdin=open('input.txt','r')
# sys.stdout=open('output2.txt','w')
from sys import stdin,stdout
from collections import deque,defaultdict
from math import ceil,floor,inf,sqrt,factorial,gcd,log2
from copy import deepcopy
ii1=lambda:int(stdin.readline().strip())
is1=lambda:stdin.readline().strip()
iia=lambda:list(map(int,stdin.readline().strip().split()))
isa=lambda:stdin.readline().strip().split()
mod=int(1e9 + 7)

n,h=iia()
arr=iia()
count=0
for i in range(n):
    if arr[i]>=h:
        count+=1
print(count)

Submission status: Accepted

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

ans = 0
for h in hlist:
  if h >= K:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
import sys

N, K = map(int, sys.stdin.readline().split())
H = map(int, sys.stdin.readline().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()))
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())
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())
a = list(map(int, input().split()))
print(sum(1 for i in a if (i>=k)))

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
ls=list(map(int,input().split()))
ans=0
for item in ls:
  if item<k:
    ans+=1
print(n-ans)

Submission status: Accepted

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

import numpy as np 

arr = np.array(input().split(),np.int64)

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

a = bisect.bisect(l, k-1)
print(n-a)

Submission status: Accepted

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

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

print(count)

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

Submission status: Accepted

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

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N,K = map(int,readline().split())
H = list(map(int,readline().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())
data = list(map(int, input().split()))
ans = 0
for d in data:
    if d >= 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()))
# N,K=4,150
# h=[150, 140, 100, 200]

harry=np.array(h)
ans=np.count_nonzero(harry>=K)

print(ans)


# import sys
# print(sys.version_info)

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 h[i] >= k:
        ans += 1
    else:
        continue

print(ans)

Submission status: Accepted

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

for height in heights:
    if height >= K:
        qualified += 1

print(qualified)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

Submission status: Accepted

Solution code:
N,K = list(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())
h = list(map(int, input().split()))
res = len(list(filter(lambda x: x >= k, h)))
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=[int(s) for s in input().split()]
h=[int(s) for s in input().split()]
count=0
for i in h:
  if i>=k:
    count+=1
print(count)
#  a.append(
#a.append(23)
#for
#print(*range(x-k+1,x+k))

Submission status: Accepted

Solution code:
#<B>
import bisect
n, k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()
ans = n
for i in h:
    if i < k:
        ans -= 1

print(ans)

Submission status: Accepted

Solution code:
n,k=[int(s) for s in input().split()]
h=[int(j) for j in input().split()]
r=0

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

print(r)

Submission status: Accepted

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

hum = 0

for h in H:
  if K <= h:
    hum += 1
    
print(hum)

Submission status: Accepted

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

total = 0

for i in A:
    if i >= k:
        total += 1
        
print(total)

Submission status: Accepted

Solution code:
import sys


# input = sys.stdin.readline

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

def main():
    N,K = map(int, input().split())
    hights = [int(s) for s in input().split()]
    
    count = 0
    for hight in hights:
        if hight >= K:
            count+= 1
    
    print(count)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

ans = 0

for i in h_int_list:
    if K <= i:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
"""
    こんにちは。これはクシャルです
    
    Author : thekushalghosh (クシャル)
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    n,k = invr()
    print(n - sorted(inlt() + [k]).index(k))
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1],1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)

def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))

def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n,k,*h=map(int,open(0).read().split())
print(sum(i>=k for i in h))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0

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

print(count)

Submission status: Accepted

Solution code:
import bisect
N,K =list(map(int,input().split()))
H =sorted(list(map(int,input().split())))
i = bisect.bisect(H,K-1)
print(N-i)

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:
import sys
import math
import numpy as np
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N,K = I()
h = l()
h.sort()
print(N-bisect.bisect_left(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())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
  if A[i] >= K:
    ans +=1
print(ans)

Submission status: Accepted

Solution code:
def solve():
    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)
    return 0

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 h:
    if i>=K:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

N, K = mapint()
Hs = list(mapint())

lis = [1 if a>=K else 0 for a in Hs]
print(sum(lis))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque, Counter
import math

# import copy
from bisect import bisect_left, bisect_right
# import heapq

# sys.setrecursionlimit(1000000)

# input aliases
input = sys.stdin.readline

getS = lambda: input().strip()
getN = lambda: int(input())
getList = lambda: list(map(int, input().split()))
getZList = lambda: [int(x) - 1 for x in input().split()]

INF = 10 ** 20
MOD = 10**9 + 7
divide = lambda x: pow(x, MOD-2, MOD)

def solve():
    n, k = getList()
    nums = getList()
    ans = 0
    for num in nums:
        if num >= k:
            ans += 1

    print(ans)
def main():
    n = getN()
    for _ in range(n):
        solve()


if __name__ == "__main__":
    # main()
    solve()

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n,k = inpl()
a = inpl()
res = 0
for x in a:
    if x >= k:
        res += 1
print(res)

Submission status: Accepted

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

Submission status: Accepted

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