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

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

Submission status: Accepted

Solution code:
#n=int(input())

#5 1,3,5
#6 1,3,5
#7 1,3,5,7
n,k=map(int,input().split())
H=list(map(int,input().split()))
ans=0
for h in H:
    if k<=h:
        ans+=1
print(ans)

Submission status: Accepted

Solution code:
def calculate(people_num, limit, height_array):
    permission = [height for height in height_array if height >= limit]
    return len(permission)
 
if __name__ == "__main__":
    people_num, limit = map(int, input().split())
    height_array = map(int, input().split())
    result_num = calculate(people_num, limit, height_array)
    print(result_num)

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())
li = list(map(int, input().split()))
print(len([i for i in li if i >= K]))

Submission status: Accepted

Solution code:
# N人数、Kcm以上必要
# 各身長

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

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

print(cnt)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(ok)

Submission status: Accepted

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

print(b)

Submission status: Accepted

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

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

h.sort()

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

N,K = (int(x) for x in input().split())
hlist = [int(i) for i in input().split()]

ans = 0

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

Submission status: Accepted

Solution code:
d, e = map(int, input().strip().split())
g = list(map(int, input().strip().split()))
#print(d, e)
#print(g)
total = 0
for i in g:
    if i >= e:
        total += 1
print(total)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    n, k, *h = map(int, string.split())
    return str(len([_h for _h in h if _h >= k]))


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

Submission status: Accepted

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

MOD = 10 ** 9 + 7

n, k = map(int, input().split())
hn = list(map(int, input().split()))

ans = sum(map(lambda x: x >= k, hn))

print(ans)

Submission status: Accepted

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

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

count=0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

print ans

Submission status: Accepted

Solution code:
NK = input().split()
N = int(NK[0])
K = int(NK[1])
h_list = [int(h) for h in input().split()]
able_number = 0
for h in h_list:
    if h >= K:
        able_number += 1
print(able_number)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, *H = map(int, open(0).read().split())
print(sum(e >= K for e in H))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X=[int(i) for i in input().split()]
Y=[int(i) for i in input().split()]
count=0
for y in Y:
  if y>=X[1]:
    count+=1
print(count)

Submission status: Accepted

Solution code:
X=[int(i) for i in input().split()]
Y=[int(i) for i in input().split()]
count=0
for y in Y:
  if y>=X[1]:
    count+=1
  else:
    pass
print(count)

Submission status: Accepted

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

counter = 0

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

print(counter)

Submission status: Accepted

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

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

Submission status: Accepted

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

h.sort()
c=0
for i in range(n):
  if h[i]<k:
    c+=1
  else:
    print(n-c)
    break
if c==n:
  print(0)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n,k = map(int,input().split(" "))


d = list(map(int,input().split(" ")))

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

Submission status: Accepted

Solution code:
def main():

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N,K = inpl()
print(sum([1 if h >= K else 0 for h in inpl()]))

Submission status: Accepted

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

print(d)

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 hh in h:
    if hh >= k:
        ans += 1
print(ans)

Submission status: Accepted

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

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

print(len)

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

a = [int(x) for x in input().split()]
ans = 0
for x in a:
    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:
import sys
import bisect

def input():
    return sys.stdin.readline().rstrip('\n')

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

Submission status: Accepted

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

    count = 0
    for n_i in range(N):
        if n[n_i] >= K:
            count += 1

    print(str(count))

solve()

Submission status: Accepted

Solution code:
def solve(n, k, h):
    return len(list(filter(lambda _: _ >= k, h)))

n, k = map(int, input().split())
h = list(map(int, input().split()))
print(solve(n, k, h))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
A = list(map(int,input().split()))
answer = 0
for i in range(n):
    if(A[i]>=k):
        answer +=1
print(answer)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

n,k = inpl()
h = inpl()
res = 0
for i in h:
    if 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 _h in h:
    if _h >= k:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
N, K, *h, = map(int, open(0).read().split())
ans = 0
for i in h:
  if K <= i:
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#gcdは3.4.3だとfractionsにある
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():

    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)




main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#input = sys.stdin.readline
def main():
    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)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    N,H = map(int,input().split())
    a = list(map(int,input().split()))
    count = 0
    for i in a:
        if i >= H:
            count += 1

    print(count)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_, k = list(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:
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    h = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, K, h)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
get = list(map(int, input().split()))
N = get[0]
K = get[1]
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,*h=map(int,open(0).read().split());print(len([x for x in h if x>=k]))

Submission status: Accepted

Solution code:
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:
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

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

Submission status: Accepted

Solution code:
# coding: utf-8


def solve():
    N, K, *hl = map(int, open(0).read().split())
    ans = 0
    
    for i in hl:
        if i >= K:
            ans += 1
    
    print(ans)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

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

Submission status: Accepted

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


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


print(ans)

Submission status: Accepted

Solution code:
import sys

#+++++
		
def main():
	n, k = map(int, input().split())
	al=list(map(int, input().split()))
	ans=len([v for v in al if v >= k])
	print(ans)

	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

rider = 0
for i in h:
    if i >= K:
        rider += 1

print(rider)

Submission status: Accepted

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

ans = 0
for h in H:
    if h >= k:
        ans += 1
    else:
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for e in a:
  if e-k >= 0:
    cnt += 1
    
print(cnt)

Submission status: Accepted

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

flag = False
for i in range(len(L)):
  if L[i] >= k:
    continue
  else:
    print(i)
    flag = True
    break
if flag == False:
  print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    N, K = map(int,input().split())
    h = list(map(int,input().split()))
    count = sum(1 if hi >= K else 0 for hi in h)
    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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)


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


if __name__ == '__main__':
    main()

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:

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

ans = 0
N = A[0]

for i in range(A[0]):
    if (h[i] >= A[1]):
        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 = list(filter(lambda x: x >= K,H))
print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:


if __name__ == "__main__":
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    print(len(list(filter(lambda x: x >= k, arr))))

Submission status: Accepted

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

_count = 0
for _member in _members:
  if _member >= _k:
    _count = _count + 1
print(_count)

Submission status: Accepted

Solution code:
import bisect

n,k=map(int,input().split())
h=[int(x) for x in input().split()]

h.sort()
print(n-bisect.bisect_left(h,k))

Submission status: Accepted

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

#output
h1 = [i-K for i in h]
h2 = [i for i in h1 if  i >= 0]
print(len(h2))

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>=0:
  	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 person in h:
    if person >= 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()))
print(sum([1 for i in h if i>=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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

h.sort()
c= 0
for i, hi in enumerate(h):
    if hi>=K:
        c=N-i
        break
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#B
input1 = input().split(" ")
h = input().split(" ")

N = int(input1[0])
K = int(input1[1])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

  print(enough)


if __name__ == '__main__':
  main()

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:
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())
a_list = list(map(int, input().split()))
count = 0
for a in a_list:
  if a >= 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:
get = list(map(int, input().split()))
N = get[0]
K = get[1]
h_i = list(map(int, input().split()))
sum = 0

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

res = 0
for hi in H:
  if hi >= K:
    res += 1

print(res)

Submission status: Accepted

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

for i in H:
    if(i >= K):
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
#abc142b
n,k=map(int,raw_input().split())
h=map(int,raw_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()))

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def func(N, K, h_i):
    count = 0
    for i in range(N):
        if h_i[i] >= K:
            count += 1
    return count

N, K = map(int, input().split(" "))
h_i = list(map(int, input().split(" ")))
print(func(N, K, h_i))

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
#import math
#import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def StoI():
    return [ord(i)-97 for i in input()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
#ts=time.time()
#sys.setrecursionlimit(10**6)
#input=sys.stdin.readline
show_flg=False
show_flg=True


n,k=MI()
a=LI()
ans=sum([1 for i in a if i>=k])
for i in range(n):
    0
    
print(ans)

Submission status: Accepted

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

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

print(r)

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

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