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

Submission status: Accepted

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

for h in H:
    if h - K >= 0:
        can_ride += 1

print(can_ride)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.stdin.readline().split()))
cnt = 0
for i in li:
  if 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 range(N):
    if h[i] >= K:
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
##B - Roller Coaster
N, K = map(int, input().split())
print(len([x for x in list(map(int, input().split())) if x >= K]))

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:
        pass

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
n, k = map(int, input().split())
h = np.array([input().split()], np.int64)
print(np.count_nonzero(h >= k))

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()))
count = 0
for i in h:
    if k <= i:
        count += 1

print(count)

Submission status: Accepted

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

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 numpy as np
N,K = map(int,input().split())
h = np.array(list(map(int,input().split())))
ans = len(h[h>=K])
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:
NK = list(map(int, input().split()))
N = NK[0]
K = NK[1]
hs = list(map(int, input().split()))
noFriends = 0
for i in hs:
    if i>=K:
        noFriends+=1
print(noFriends)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

list_ok = filter(lambda x : x >= k, list_n)
print(len(list(list_ok)))

Submission status: Accepted

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

count = 0
for height in list:
    if height >= K:
        count = count + 1
print(count)

Submission status: Accepted

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

print(len(h))

Submission status: Accepted

Solution code:
#--Roller Coaster

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

j = 0
for i in range(N):
  if (high[i] >= K):
    j += 1
  else:
    pass

print(j)

Submission status: Accepted

Solution code:
import os

def main():
	n,k = map(int, input().split())
	h_list = list(map(int, input().split()))
	count = 0

	for i in h_list:
		if k <= i:
			count += 1
		else:
			pass
	print(count)

if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ライブラリの読み込み
import math

#入力値の格納
n,k = map(int,input().split())
members = input().split()

#計算用カウンタの初期化
i = 0 #試行回数
p = 0 #不合格の人数

#身長との比較
while i < n:
    if int(members[i]) < k:
        p += 1
    i += 1

#表示
print(n-p)

Submission status: Accepted

Solution code:
from math import factorial as fact
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(n,r))

def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)



n,k=input2()
h=input_array()
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(len([0 for x in input().split() if int(x) >= k]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest

def resolve():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))

    print(sum([1 for hh in h if hh >= k]))

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """4 150
150 140 100 200"""
        output = """2"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1 500
499"""
        output = """0"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """5 1
100 200 300 400 500"""
        output = """5"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 142: B – Roller Coaster
N, K = [int(s) for s in input().split()]
h = [int(s) for s in input().split()]

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

Submission status: Accepted

Solution code:
import numpy as np
n, k = map(int, input().split())
aa = np.array(list(map(int, input().split())))
print(sum(aa >= k))

Submission status: Accepted

Solution code:
line1 = input()
line2 = input()
n, k = line1.split(" ")
h_list = line2.split(" ")
k = int(k)
h_list = [int(h) for h in h_list]

ans = 0

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

Submission status: Accepted

Solution code:
import sys
from bisect import bisect_right as bsr
from collections import Counter as cnt
from collections import defaultdict as dd
from collections import deque
from fractions import gcd
from itertools import combinations as comb
from itertools import permutations as perm
from math import ceil, factorial, floor
from operator import itemgetter as ig

sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    N, K = input(int, int)
    H = input([int, N])
    print(len([h for h in H if K <= h]))


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

Submission status: Accepted

Solution code:
#Coding:Utf-8
import sys
input=sys.stdin.readline
from heapq import heappop,heapify

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

for i in range(N):
    h[i]=0-h[i]
heapify(h)
ans=0

while ans!=N:
    if heappop(h)<=(-K):
        ans+=1
    else:
        break

print(ans)

Submission status: Accepted

Solution code:
#Coding:Utf-8
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:
#Coding:Utf-8

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()))
cnt=0

for num in h:
    if num>=k:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    n, k = map(int, input().split())
    H = list(map(int, input().split()))

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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt =0
for  x in  h:
    if x>=int(K):
        cnt = cnt +1
        
print(cnt)

Submission status: Accepted

Solution code:
import itertools
##print(ord("A"))
#n = int(input())
n,k = map(int,input().split())
h = list(map(int,input().split()))	
ans = 0
for i in range(n):
    #print(i)
    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
for t in h:
    if t >= k:
        ans += 1
print(ans)

Submission status: Accepted

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

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 = 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:
def main():
    N, K = map(int, input().split())
    H = [int(a) for a in input().split()]
    cnt = 0
    for i in range(N):
        if H[i] >= K:
            cnt += 1
    print(cnt)
main()

Submission status: Accepted

Solution code:
x = input()
y = input()
n = int(x.split()[0])
k = int(x.split()[1])
list = y.split(' ')
count = 0

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, K = MAP()
h = LIST()
cnt = 0

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

Submission status: Accepted

Solution code:
friends, minimum_height = map(int, input().split())
friends_height = list(map(int, input().split()))

tall_friends = 0

for i in range(friends):
  if friends_height[i]>=minimum_height:
    tall_friends += 1
print(tall_friends)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
_,a = list(map(int,input().split()))
hoge = list(map(int,input().split()))
count = 0
for i in hoge:
  if i >= a:
    count += 1
print(count)

Submission status: Accepted

Solution code:
N, K = map(int,input().split())
arr = list(map(int,input().split()))
arr.sort()
cnt = 0
for i in range(N-1,-1,-1):
	if(arr[i]<K):
		break
	cnt+=1
print(cnt)

Submission status: Accepted

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

for high in h:
    if high >= 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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7


def main():
  N, K = map(int, readline().split())
  H = list(map(int, readline().split()))
  ans = N
  for i in range(N):
    if H[i]<K:
      ans -= 1
  print(ans)
  
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

for i in range(n):
	if list[i]>=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 if x >= K else 0 for x in a]))

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    _, k = mi()
    h_passed = list(filter(lambda x: x>=k, lmi()))
    print(len(h_passed))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(N: int, K: int, h: "List[int]"):
    c = 0
    for i in range(N):
        if h[i]>=K:
            c+=1
    print(c)
    return


# 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]"
    solve(N, K, h)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# 初期入力
N,K = (int(x) for x in input().split())
H = list(map(int, input().split()))

#
noreru =[ i for i in H if K <=i]
print(len(noreru))

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

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

print(n)

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
inp = list(map(int, input().split()))
n, k = inp[0], inp[1]
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:
a,b=map(int,input().split())
s=list(map(int,input().split()))

count=0
for i in range(a):
  if s[i]>=b:
    count=count+1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
nim, mike = map(int, input().split())

kite = map(int, input().split())

print(sum(zen >= mike for zen in kite))

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

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

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

Submission status: Accepted

Solution code:
import numpy as np
n, k = map(int, input().split())
h = np.array(list(map(int, input().split())), np.int64)
print(sum(h >= k))

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    q2()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
B - Roller Coaster
https://atcoder.jp/contests/abc142/tasks/abc142_b

"""
import sys


def solve(N, K, heights):
    return sum(1 for h in heights if h >= K)


def main(args):
    N, K = map(int, input().split())
    heights = [int(h) for h in input().split()]
    ans = solve(N, K, heights)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
import sys

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))


n,k=MI()
h=LI()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int,input().split())
ary1 = map(int,input().split())
print(sum(x>=K for x in ary1))

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

num_of_rideable = 0

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

print(num_of_rideable)