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:
#!/usr/bin/env python3
#ABC142 B

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

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

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

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

n,k = m()

a = l()

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())
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:
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
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)]

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;
import java.lang.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int k = sc.nextInt();

        int ans = 0;
        
        for (int i = 0; i<n; i++){
            if (sc.nextInt() >= k)
                ans++;
        }
        System.out.println(ans);
    }
}

Submission status: Runtime Error

Solution code:
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse=True)
if h[-1] > k:
    ans = n
else:
    for i in range(n):
        if h[i] < k:
            ans = i
            break
print(ans)

Submission status: Runtime Error

Solution code:
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse=True)
if h[-1] > k:
    ans = n
else:
    for i in range(n):
        if h[i] < k:
        	ans = i
        	break
print(ans)

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
s=0
for hi in range(n):
    hi=int(input())
    if hi>=k:
        s=s+1
print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
def atc_142b(NK_input: str, hi_input: str) -> int:
    N, K = map(int, NK_input.split(" "))
    hi = [int(i) for i in hi_input.split(" ")]
    hi = sorted(hi)
    for i in range(0, len(hi)):
        if hi[i] >= K:
            return len(hi) - i
    return 0

NK_input_value = input()
hi_input_value = input()
pritn(atc_142b(NK_input_value, hi_input_value))

Submission status: Runtime Error

Solution code:
result = 0

for h in heights:
    if h >= K:
        result += 1
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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:
    ans = n-i
    break

print(ans)

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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: Runtime Error

Solution code:
N,K = map(int,input().split())
H = sorted(map(int,input().split()))
for i in range(N):
    if H[i]>=K:
        count = i
        break
print(max(N-count,0))

Submission status: Runtime Error

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

n, k = map(int, input().split())
cnt = 0

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

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


print(cnt)

Submission status: Runtime Error

Solution code:
N, K = list(map(lambda n: int(n), input().split(" ")))
h = list(map(lambda x: int(n), input().split(" ")))
print(len(list(filter(lambda height: height >= K, h))))

Submission status: Runtime Error

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

Submission status: Runtime Error

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:
        cnt += 1

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = 0
for i in h:
  if h >= K:
    ans += 1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A=B=int(input())
N = list(int,input().split())

c=0

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

Submission status: Runtime Error

Solution code:
import sys
n, k = map(int, sys.stdin.readline().rstrip().split(' '))
a = map(int, sys.stdin.readline().rstrip().split(' '))
 
count = 0
for i in range(len(a)):
  if a[i] >= k:
    count += 1

print(count)

Submission status: Runtime Error

Solution code:
import sys
n, k = map(int, sys.stdin.readline().rstrip().split(' '))
a = map(int, sys.stdin.readline().rstrip().split(' '))

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

return count

Submission status: Runtime Error

Solution code:
import numpy as np

N,K=map(int,input().split())
h=list(map(int,input().split()))
# N,K=4,150
# h=[150, 140, 100, 200]

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

print(ans[0][1])


# import sys
# print(sys.version_info)

Submission status: Runtime Error

Solution code:
import numpy as np

N,K=map(int,input().split())
h=list(map(int,input().split()))
# N,K=4,150
# h=[150, 140, 100, 200]

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


print(harry)
print(ans[0][1])
print(type(ans))

Submission status: Runtime Error

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

for height in heights:
    if height < K:
        unqualified += 1

print(unqualified)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
h = list(map(int,ipunt().split()))
a = {}
sum = 0
for i in h
  	if( h[i] >= K):
		sum++
print(sum)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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

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

print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
import decimal # 10進法に変換，正確な計算

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

def main():
    n = int(input())
    n = decimal.Decimal(n)
    if n % 2 == 0:
        print(1/decimal.Decimal(2))
        return
    
    print(((n-1)/2+1)/n)

    
    
main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m = map(int, raw_input().split(' '))
print sum([1 for e in  map(int, raw_input().split(' ')) if e >= m else 0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
count = 0
N = int(input())
K = int(input())
hi_list = list()
while count < N:
    count += 1
    hi = int(input())
    hi_list.append(hi)
ok_list = list()
for data in hi_list:
    if data >= K:
        ok_list.append(data)
print(len(ok_list))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

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

count = 0

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

print(count)

Submission status: Runtime Error

Solution code:
# -*- coding: <encoding name> -*-

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

count = 0

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

print(count)

Submission status: Runtime Error

Solution code:

N, K = [int(_) for _ in input().split()]
h = [int(_) for _ in input().split()]
print(len([i for i in h if

Submission status: Runtime Error

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

h = [int(x) for x in input().split()]
cnt=0
for i in n:
    if h[i] < k:
        cnt+=1
print(cnt)

Submission status: Runtime Error

Solution code:

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
h=list(int,input().split())
ans=n
for i in h:
    if i<k:
        ans-=1
print(ans)

Submission status: Runtime Error

Solution code:
n, k = map(int,input().split())
print(len([*filter(lambda hi: hi >= k, map(int,input().split()))]))

Submission status: Runtime Error

Solution code:
import sys
n, k = map(int, sys.stdin.readline().split())
li = list(map(int, sys.readline().split()))
cnt = 0
for i in li:
  if i >= k:
    cnt += 1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
count = 0
lia = []
lib = list(map(int,input().split()))
for i in range(1,n+1):
    lia.append(i)
for i in range(n):
    if lia[i] != lib[i]:
        count += 1
    if count > 3:
        print("NO")
        break
if count <= 2:
    print("YES")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
_,b = list(map(int, input()))
hoge = list(map(int,input()))

count = 0
for i in hoge:
  if i >= b:
    count += 1
    
print(count)

Submission status: Runtime Error

Solution code:
a = input()
N = a[0]
K = a[2]
friends_heights = [int(input()) for i in range(N)]
count = 0
for friend in friends_height:
  if friend >= K:
    count += 1
  else:
    pass

print(count)

Submission status: Runtime Error

Solution code:
a = input().split(' ')
N = a[0]
K = a[2]
friends_heights = [int(input()) for i in range(N)]
count = 0
for friend in friends_height:
  if friend >= K:
    count += 1
  else:
    pass

print(count)

Submission status: Runtime Error

Solution code:
a = input().split(' ')
N = a[0]
K = a[1]
  

friends_heights = [int(input()) for i in range(N)]
count = 0
for friend in friends_height:
  if friend >= K:
    count += 1
  else:
    pass

print(count)

Submission status: Runtime Error

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

friends_heights = [int(input()) for i in range(N)]
count = 0
for friend in friends_height:
  if friend >= K:
    count += 1
  else:
    pass
print(count)

Submission status: Runtime Error

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

friends_heights = [int(input()) for i in range(N)]
count = 0
for friend in friends_height:
  if friend >= K:
    count += 1
  else:
    pass
print(count)

Submission status: Runtime Error

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

friends_heights = [int(input(i)) for i in N]
count = 0
for friend in friends_height:
  if friend >= K:
    count += 1
  else:
    pass
print(count)

Submission status: Runtime Error

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

friends_heights = [int(input(i)) for i in N]
count = 0
for friend in friends_height:
  if friend >= height:
    count += 1
  else:
    pass
print(count)

Submission status: Runtime Error

Solution code:
friends_freq, height = map(int, input().split())

friends_heights = [int(i) for i in input()]
count = 0
for friend in friends_height:
  if friend >= height:
    count += 1
  else:
    pass
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(map(str, input().split()))
def pl(a): print(" ".join(list(map(str, a))))
def ma():return map(int,input().split())
def nli(x):return [input for _ in range(x)]
def hukusuu(): 
  listA=[] #appendのために宣言が必要
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break #または、quit(),os.exit()をして止める。
  return listA

n,k=ma()
h=rli()

from itertools import accumulate , groupby as acc , gp
import operator as op
import copy as cp
import math
from bisect import bisect_left as bisl
from bisect import bisect_right as bisr
def ifif(s):
  if s:print("Yes")
  else:print("No")

h.sort()
inde=bisl(h,k)
print(n-inde)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

for i in range(M):
  if int(h[i])>K:
    c+=1
print(c)

Submission status: Runtime Error

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

if 1 == len(l):
    if l[0] >= k:
        print(1)
    else:
        print(0)
    exit()
        
suffix = n // 2
if l[suffix] <= k:
    for i in range(suffix, n+1):
        if l[i] >= k:
            min_suffix = i
            print(n - min_suffix)
            exit()
else:
    for i in range(suffix):
        if l[i] >= k:
            min_suffix = i
            print(n - min_suffix)
            exit()
            
print(0)

Submission status: Runtime Error

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

ans = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split(" "))
List = sorted([int(i) for i in input().split(" ")],reverse=True)
h=0
while(List[h]>=K):
    h+=1
print(h)

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

Solution code:
package main

import(
  "fmt"
)

func main() {
  var n, k int
  fmt.Scan(&n, &k)
  
  heights := []int{}
  var h int
  for i := 0; i < n; i++ {
    fmt.Scan(&h)
    heights = append(heights, h)
  }
  
  count := 0
  for _, h := range heights {
    if h >= k {
      count++
    }
  }
  
  fmt.Println(count)
}

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0]*n

for i in range(n):
    ans[a[i]-1]=i+1

print(" ".join(map(str,ans)))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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: Runtime Error

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

f = 0

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

print(f)

Submission status: Runtime Error

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

f = 0

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

print(f)

Submission status: Runtime Error

Solution code:

inputA =  list(map(int,input().split()))
inputB =  list(map(int,input().split()))

humancount = inputA[0]
talllimit = inputA[1]
count= 0

for count in range(0,humancount):
    if inputB(count) >= talllimit:
        count += 1


print(count)

Submission status: Runtime Error

Solution code:
import numpy

N,K = [int(s) for s in input.split()]
heights = np.array([int(s) for s in input().split()])

sum(heights > K)

Submission status: Runtime Error

Solution code:
N,K = [int(s) for s in inpput().split()]
heights = [int(s) for s in input().split()]

count = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
N = int(input())
K = int(input())
count = 0
for i in range(1,N+1):
    n = int(input())
    if n >= K:
        count += 1
    else: continue
print(count)

Submission status: Runtime Error

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: Runtime Error

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