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

c = 0

for x in h:
    if x >= k:
        c += 1

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

h = [True for i in range(n) if h[i] >= k]
print(sum(h))

Submission status: Accepted

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

print(len([m for m in [int(x) for x in input().split(' ')] if m >= K]))

Submission status: Accepted

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

Submission status: Accepted

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

for i in 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()))
H.sort()
cnt = 0
for h in H:
    if h >= K:
        break
    cnt += 1
print(N - cnt)

Submission status: Accepted

Solution code:
from bisect import bisect_left

N, K = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
ans = bisect_left(h, K)
print(N - ans)

Submission status: Accepted

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


lst = []
for i in Heights:
	if i >= K:
		lst.append(i)
print(len(lst))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
for i in h_list:
    if i >= K:
        count += 1
    else:
        pass

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(input_line,input_arr):
    """Test Case
    >>> print_ans("4 150","150 140 100 200")
    2
    >>> print_ans("1 500","499")
    0
    >>> print_ans("5 1","100 200 300 400 500")
    5
    """
    N, K = list(map(int,input_line.split()))
    arr = list(map(int,input_arr.split()))
    ans = filter(lambda x:x >= K, arr)
    print(len(list(ans)))

if __name__ == '__main__':
    N = input()
    arr = input()
    print_ans(N,arr)

Submission status: Accepted

Solution code:
x, y = map(int,input().split())
li = list(map(int,input().split()))

li.sort
count = 0

for i in li:
    if y <= i:
        count += 1

print(count)

Submission status: Accepted

Solution code:
import sys


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


sys.setrecursionlimit(1000000)
mod = 1000000007


# A
def A():
    return


# B
def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        if i >= k:
            ans += 1
    print(ans)
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


def resolve():
    B()
    return


# Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

Solution code:
import sys


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


sys.setrecursionlimit(1000000)
mod = 1000000007


# A
def A():
    return


# B
def B():
    n, k = LI()
    h = LI()
    ans = 0
    for i in h:
        if i >= k:
            ans += 1
    print(ans)
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

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

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

s = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

N, K = map(int, input().split())
print(int(np.sum(np.array(list(map(int, input().split()))) >= K)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

res = sum([h >= k for h in hs])
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
size, min = map(int, input().split())
persons = [int(x) for x in input().split()]
result = 0
for person in persons:
  if (person >= min):
    result += 1
print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


if __name__ == "__main__":
  N, K = map(int, input().split())
  h = list(map(int, input().split()))
  res = len(list(filter(lambda x: x>=K, h)))
  print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

n = sum(1 for x in hlist if x>=k)
print(n)

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

Submission status: Accepted

Solution code:
import numpy as np

n, k = map(int, input().split())
h = list(map(int, input().split()))
print(np.count_nonzero(np.array(h) >= k))

Submission status: Accepted

Solution code:
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(150, [150, 140, 100, 200]), 2)

    def test_2(self):
        self.assertEqual(think(500, [499]), 0)

    def test_3(self):
        self.assertEqual(think(1, [100, 200, 300, 400, 500]), 5)


def solve():
    k, h = read()
    result = think(k, h)
    write(result)


def read():
    n, k = read_int(2)
    h = read_int(n)
    return k, h


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(k, h):
    return len(list(filter(lambda x: x >= k, h)))


def write(result):
    print(result)


if __name__ == '__main__':
    # import sys
    # sys.setrecursionlimit(10000)
    # unittest.main()
    solve()

Submission status: Accepted

Solution code:
li = lambda: list(map(int,input().split()))

n, k = li()
h = li()
print(sum(hh >= k for hh in h))

Submission status: Accepted

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

Submission status: Accepted

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

c=0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(result)

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:
from sys import stdin

input = stdin.readline


def p_a():
    n = int(input())
    print(((n + 1) // 2) / n)


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

    print(sum(map(lambda x: x >= k, h)))


if __name__ == '__main__':
    p_b()

Submission status: Accepted

Solution code:
from sys import stdin
import bisect
n, k = [int(x) for x in stdin.readline().rstrip().split()]
h = [int(x) for x in stdin.readline().rstrip().split()]
h.sort()
K = bisect.bisect_left(h, k)
print(n - 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 = map(int, input().split())
h = [int(x) for x in input().split()]

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
N, K = map(int, raw_input().split())
hs = map(int, raw_input().split())
print sum(1 for h in hs if h >= K)

Submission status: Accepted

Solution code:
import numpy as np
N, K = map(int, input().split())
h = list(map(int,input().split()))
hh = np.array(h)
print((hh>=K).sum())

Submission status: Accepted

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

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

for h in H:
  if h >= K:
    number += 1
print(number)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
from enum import Enum
from queue import Queue

import numpy as np

import collections
import bisect
import sys
import math

from scipy.sparse.csgraph import floyd_warshall

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()
hs = input().split()

N,K = int(N),int(K)
hs = [int(h) for h in hs]

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

Submission status: Accepted

Solution code:
k = int(input().split(' ')[1])
a = input().split(' ')
b = []
for i in a:
    b.append(int(i))
b.sort()
for i in range(len(b)):
    if b[i] >= k:
        print(len(b) - i)
        exit(0)

print(0)

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc142/tasks/abc142_b
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())
l=list(map(int,input().split()))
o=[x for x in l if x>=k]
print(len(o))

Submission status: Accepted

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

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


print(count)

Submission status: Accepted

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

Submission status: Accepted

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

print(len([0 for i in range(len(h)) if h[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:
import bisect
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(n - bisect.bisect_left(h, k))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
_, min_height = map(int, input().split())
heights = list(map(int, input().split()))

res = sum(1 for h in heights if h >= min_height)
print(res)

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
N,K = input().split()
N = int(N)
K = int(K)
H = input().split()
H = [int(s) for s in H]
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=N
for i in range(N):
    if h[i]<K :
        Ans=i
        break

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

answer = 0
for l in L:
    if l >= C:
        answer += 1
print(answer)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
# B - Roller Coaster
from bisect import bisect_left

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

H.sort()
ans = N - bisect_left(H, K)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

l = []
for i in a:
    if i>=k:
        l.append(i)
result = len(l)
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(count)

Submission status: Accepted

Solution code:
import numpy as np
import scipy as sc

n,k = map(int,input().split())
h = np.array(list(map(int,input().split())))
print(np.sum(h>=k))

Submission status: Accepted

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

z=0
for i in v:
    if i>=K:
         z=z+1

print(z)

Submission status: Accepted

Solution code:
import bisect

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

h.sort()
ans = N - bisect.bisect_left(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 h:
    if i>=K:
        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(" ")]

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
l=list(map(int, input().split()))
ans=int(0)
l.sort()
t=int(0)
while True:
    if l[t]>=k:
        ans = n-t
        break
    t +=1
    if t==n:
        break
print(ans)

Submission status: Accepted

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

print(ans)

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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    n, k = MAP()
    h = [x for x in LIST()if x>=k]

    print(len(h))

if  __name__=='__main__':
    main()

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 permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

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

Submission status: Accepted

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

H = sorted(H)
def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while(end >= start):
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid+1
        elif x < arr[mid]:
            end = mid -1
        else:
            for i in range(mid-start):
                if arr[mid-i-1] < x:
                    start = mid - i
                    break
            break
    print(N-start)
binary_search(H, K)

Submission status: Accepted

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

H = sorted(H)
def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while(end >= start):
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid+1
        elif x < arr[mid]:
            end = mid -1
        else:
            for i in range(mid-start):
                if arr[mid-i-1] < x:
                    start = mid - i
                    break
            break
    return (N-start)
print(binary_search(H, K))

Submission status: Accepted

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

H = sorted(H)
def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while(end >= start):
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid+1
        elif x < arr[mid]:
            end = mid -1
        else:
            for i in range(mid-start):
                if arr[mid-i-1] < x:
                    start = mid - i
                    break
            break
    return start
print(N - binary_search(H, K))

Submission status: Accepted

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

H = sorted(H)
def binary_search(arr, s, e, x):
    end=e
    start=s
    if end >= start:
        mid = int(s + (end-start)/2)
        if x > arr[mid]:
            binary_search(arr, mid+1, end, x)
        elif x < arr[mid]:
            binary_search(arr, start, mid-1, x)
        else:
            for i in range(mid-start):
                if arr[mid-i-1] < x:
                    start = mid - i
                    break
            print(len(arr)-start)
    else:
        print(len(arr)-start)
binary_search(H,0,N-1,K)

Submission status: Accepted

Solution code:
human_count, max_height = [int(i) for i in input().split()]
height_list = [int(i) for i in input().split()]
print(len([x for x in height_list if x >= max_height]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
n,k=[int(x) for x in input().split()]
h=[int(x) for x in input().split()]
h.sort()
print(n-bisect.bisect_right(h,k-1))

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:
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_i=list(int(x) for x in input().split())
count=0

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

Submission status: Accepted

Solution code:
#人数と身長制限を取得
N,K  = map(int, input().split(" "))

#それぞれの身長を取得
h = list(map(int,input().split(" ")))

#乗れる人数を確認する

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

print(result)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M= map(int,input().split())
h = list(map(int,input().split()))
cou = 0
for i in h:
    if M<=i:
        cou+=1
print(cou)

Submission status: Accepted

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

cnt = 0
for i in h:
    if i >= M:
        cnt += 1
        
print(cnt)

Submission status: Accepted

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

h_list.append(k)
h_list.sort()

idx = h_list.index(k)

print(len(h_list)-1-idx)

Submission status: Accepted

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

Submission status: Accepted

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

h.sort()
a = 0

for i in range(N):
  if h[i] >= K:
    a += i
    break
  else:
    continue
if max(h) < K:
  a += N
print(N-a)