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

Submission status: Accepted

Solution code:
n, t = [int(i) for i in input().split()]
h = [int(i) for i in input().split() if int(i) >= t]

print(len(h))

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 = [int(el) for el in input().split(' ')]
H = [int(el) for el in input().split(' ')]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def answer():
    n, k = map(int, input().split())
    heights = list(map(int, input().split()))
    ans = sum(map(lambda h: h >= k, heights))
    print(ans)


if __name__ == '__main__':
    answer()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
N,K = list(map(lambda x: int(x),input().split()))
h = np.array(list(map(lambda x: int(x),input().split())))
print(len(np.where(h >= K)[0]))

Submission status: Accepted

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

    cnt = 0

    for height in h:
        if height >= K:
            cnt += 1
    
    print(cnt)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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


flag = 0
for i in member:
    if i >= k:
        flag += 1
print(flag)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

times = 0

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

Submission status: Accepted

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

inputData = input().split()
H = [int(x) for x in inputData]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = list(int(el) for el in input().split(' '))

num=0

for hi in list(int(el) for el in input().split(' ')):
  if hi>=K:
    num+=1
    
print(num)

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 - Roller Coaster
N, K = map(int, input().split())
h = list(map(int,input().split()))
count = 0

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

print(count)

Submission status: Accepted

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

# print(N, K)
# print(h_list)

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

print(cnt)

Submission status: Accepted

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

cnt = 0

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

print(cnt, end='')

Submission status: Accepted

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

l = [int(x) for x in input().split(' ')]

ret = 0

for h in l:
  if h >= k:
    ret += 1

print(ret)

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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

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

cnt=0
for hi in h:
    if(hi>=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 h in H:
    if h >= K:
        ans += 1
        
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import numpy as np

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

    c = 0
    for i in h_list:
        if i >= k:
            c += 1

    print(c)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

ans = sum([ 1 for x in hn if x>=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 h:
    if i >= k:
        count += 1

print(count)

Submission status: Accepted

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

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

print(number)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import heapq
import bisect
import itertools

mod = 10**9+7
dd = ((-1,0),(1,0),(0,-1),(0,1))

def I(): return(int(sys.stdin.readline()))
def LI(): return([int(x) for x in sys.stdin.readline().split()])
def LI_(): return([int(x)-1 for x in sys.stdin.readline().split()])
def S(): return(sys.stdin.readline()[:-1])
def IR(n): return([I() for _ in range(n)])

def GCD(a,b):
    while b!=0:
        a,b = b,a%b
    return a

def LCM(a,b):
    return a * b // GCD(a,b)

def Eratosthenes(N):
    r = [True]*(N+1)
    r[0] = False
    r[1] = False
    i = 2
    while i*i<=N:
        if r[i]: 
            j = i
            while i*j<=N:
                prime[i*j]=False
                j+=1
        i+=1
    return(r)

def main():
    N,K = LI()
    H = LI()

    ans = 0
    for h in H:
        if h>=K:
            ans += 1
    return(ans)

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

print(sum([i >= K for i in h_n]))

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([i >= k for i in h]))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

counter = 0
hList = [int(i) for i in input().split()]

for i, e in enumerate(hList):
    if e >= K:
        counter += 1

print(counter)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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:
import numpy as np

l = raw_input().split()
N = int(l[0])
K = int(l[1])

h = map(int, raw_input().split())

h = np.array(h)

print np.sum(h >= K)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import copy

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

count = int(0)
ans = int(0)

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

ans = count

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

n, k = map(int, sys.stdin.readline().split())
H = list(map(int, sys.stdin.readline().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()))

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

print(count)

Submission status: Accepted

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

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 

n,k = [int(i) for i in readline().split()]
h = [int(i) for i in readline().split()]


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

Submission status: Accepted

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

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

count = 0

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

Submission status: Accepted

Solution code:
def main():
  n, k = map(int, raw_input().split())
  heights = map(int, raw_input().split())
  cnt = 0
  for h in heights:
    if h >= k:
      cnt += 1
  print(cnt)
  

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

N, K = [int(x) for x in input().split(" ")]
heights = [int(x) for x in input().split(" ")]
count = 0
for height in heights:
    if height >= K:
        count += 1
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

N, K = map(int, input().split())
A = list(map(int,input().split()))
ctr = 0

for i in A:
    if i >= K:
        ctr += 1
print(ctr)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(N, K, h):
    return sum(h1 >= K for h1 in h)


if __name__ == '__main__':
    N, K = map(int, input().split())
    h = map(int, input().split())

    ans = solve(N, K, h)

    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ct = 0
for h in hlist:
    if h>=K:
        ct+=1
print(ct)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N, K = list(map(int, input().split()))
h = np.array([int(a) for a in input().split()])
print(np.count_nonzero(h >= K))

Submission status: Accepted

Solution code:
def main():
    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)
if __name__ == '__main__':
    main()

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=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:
# -*- coding: utf-8 -*-
N, K = map(int,input().split())
h = list(map(int,input().split()))

answer = 0

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

Submission status: Accepted

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

output = 0
for h in h_list:
    if h >= k:
        output += 1

print(output)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
n,k=map(int,input().split())
hh=map(int,input().split())
print(sum(h >=k for h in hh))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

def isprime(n):
  for i in range(2,int(n**0.5)+1):
    if n%i == 0:
      return False
  return True


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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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 = map(int, input().split())
h = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:

import sys
from collections import deque, defaultdict
import copy
import bisect
sys.setrecursionlimit(10 ** 9)
import math
import heapq
from itertools import product, permutations,combinations
import fractions

import sys
def input():
	return sys.stdin.readline().strip()

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

h.sort()

loc = bisect.bisect_left(h, K)

print(N - loc)

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
h_list = list(map(int,input().split()))
count = 0
for h in h_list:
    if h >= 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:
# -*- coding: utf-8 -*-
# abc142/abc142_b
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    N,K = i2nn()
    h = i2nn()
    print(len([x for x in h if x >= K]))
    return

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

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

mycnt = 0

for i in mylist:
    if i >= K:
        mycnt += 1

print(mycnt)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys

#input = sys.stdin.readline

#import heapq

def main():
#    h,w,a,b = map(int, input().split())
    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)
#    for i in range(h):
#            print(aaa)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
from pprint import pprint
sys.setrecursionlimit(2147483647)


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007



from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


n, k = LI()
A = LI()
cnt = 0
for i in A:
    if i >= k:
        cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():
    input = lambda: stdin.readline()[:-1]
    N, K = map(int, input().split())
    H = map(int, input().split())

    ans = 0
    for h in H:
        ans += K <= h
    print(ans)

main()

Submission status: Accepted

Solution code:
import sys

N,K=map(int, raw_input().split())
H=map(int, sys.stdin.readline().split())

ans=0
for h in H:
	if K<=h:
		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 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 k <= h[i]:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for ele in h:
    if ele>=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,reverse=True)
ind = 0
for i in range(N):
    if H[i]<K:
        print(i)
        ind = 1
        break
if ind==0:
    print(N)

Submission status: Accepted

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

p = 0
for i in nums:
  if i >= k:
    p += 1
print(p)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


# Generated by 1.1.4 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 = map(int, input().split())
l = list(map(int, input().split()))
c = 0
for h in l:
    if K <= h:
        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 range(n):
  if h[i] >= k:
    ans += 1
    
print(ans)

Submission status: Accepted

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

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

print(ans)

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

print(count)

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

if __name__ == '__main__': main()

Submission status: Accepted

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

Submission status: Accepted

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