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

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

Submission status: Runtime Error

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

for i in range(n):

    if h[i] >= k:
        tmp += 1

print(tmp)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, k = list(map(int,input().split()))
h = list(map(int,input().split()))
print(sum([map(lambda x: 1 if x - k >= 0 else 0, h)]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
k = 0
g = 0
for i in range(1,n+1) :
    if i % 2 == 0:
        g += 1
    else :
        k += 1
print(k/(g+k))

Submission status: Runtime Error

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

count=0
for j in i:
    if(j>=int(N[1])):
        count+=1

print(count)

Submission status: Runtime Error

Solution code:
try:
	num_people = int(input("ENter the number of people: "))
	height_min = int(input("Enter the minimum height people can roller coaster: "))
	i = 1
	height = list()
	allowed_person = 0

	while i <= num_people < 100000:
		height = int(input(f"Ente the height of number {i} person: "))
		if height_min <= height <= 500:
			allowed_person += 1
		i += 1
	print(allowed_person)

except Exception as e:
	print(e)

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

Solution code:
#include<iostream>
using namespace std;
int main() {
    int n,s;
    cin >> n >> s;
    int d=0;
    for (int i=0;i<n;i++){
        int a; cin>>a;
        if (a>=s) d++;
    }
    cout << d << "\n";
    return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,k=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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(p)

Submission status: Runtime Error

Solution code:
n,k =(int(x) for x in input().split())
list = (int(x) for x in input().split())
p = 0

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

print(p)

Submission status: Runtime Error

Solution code:
N,K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a=0:
for i in h:
  if i>=K:
    a+=1
  else:
    break
print(a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a=0:
for i in h:
  if i>=h:
    a+=1
  else:
    break
print(a)

Submission status: Runtime Error

Solution code:
N,K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a=0:
for i in h:
  if i>=h:
    a+=1
  else:
    break

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

for i in h:
  if !(h<K):
    smy+=1:
print(smy)

Submission status: Runtime Error

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

c = 0
for i in lis:
        if i >= e:
            c += 1
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys


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


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


# A
def A():


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


# C
def C():


# D
def D():


# E
def E():


# F
def F():


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

Submission status: Runtime Error

Solution code:
import sys


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


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


# A
def A():


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

# C
def C():


# D
def D():


# E
def E():


# F
def F():


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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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


if __name__ == '__main__':
    p_b()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans_list = []
for i in range(1, N + 1):
    ans_list.append(A_list.index(i) + 1)
    
print(' '.join([str(n) for n in ans_list]))

Submission status: Runtime Error

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

for i in range(1,N+1):
    b.append(a.index(i) + 1)

print(*b, sep=' ')

Submission status: Runtime Error

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

print(x)

Submission status: Runtime Error

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

print(x)

Submission status: Runtime Error

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

print(Ans)

Submission status: Runtime Error

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

N=ipt[0]
K=ipt[1]
h=ipt[2:]

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

print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
l = list(map(int, input().split())
ans = 0
while max(l) <= K:
         l.remove(max(l))
         ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
l = list(map(int, input().split())
ans = 0
while True:
  if max(l) >= K:
    l.remove(max(l))
    ans += 1
    
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
l = [map(int, input().split())]
ans = 0
while max(l)<K:
  if max(l) >= K:
    l.remove(max(l))
    ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
l = [map(int, input().split())]
ans = 0
while True:
  if max(l) >= K:
    l.remove(max(l))
    ans += 1
    
print(ans)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
l = []
l += map(int, input().split())
ans = 0
while True:
  if max(l) >= K:
    l.remove(max(l))
    ans += 1
    
print(ans)

Submission status: Runtime Error

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

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

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

print(z)

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

print(ans)

Submission status: Runtime Error

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

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

ans = 0
[ans+= for i in h if i>=50]

print(ans)

Submission status: Runtime Error

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

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

Solution code:
n=list(int(input().splice()))
n[1]=K
h=list(int(input().splice()))

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

print(count)

Submission status: Runtime Error

Solution code:
ｌ

Submission status: Runtime Error

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(a) < K:
  a += N
print(N-a)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import time

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 n[i] >= K:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
x = input().split()
y = input().split()

cnt = 0

for i in y:
  if i >= int(x[1]):
    cnt += 1
    
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
height_list = list(map(int,input().split()))
print(sum(1 for i in height_list if i >= K]))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
K = input()
counter = 0
for i in range(int(N)):
    temp = int(input())
    if temp >= int(K) :
       counter = counter + 1
print(counter)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
counter = 0
for i in range(int(N)):
    if int(input()) >= int(K) :
       counter = counter + 1
print(counter)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
counter = 0
for i in range(int(N))
    if int(input()) >= int(K) :
       counter++
print(counter)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
counter = 0
for i in range(N)
    if input() >= K :
       counter++
print(counter)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
for i in N
    if input() >= K :
       counter++
print(counter)

Submission status: Runtime Error

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

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

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:
        break
print(i)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
N = int(N)
K = int(K)

high = list()
for i in range(N-1):
  F = input()
  F = int(F)
  high.append(F)

count = 0
for j in range(N-1):
  if high[j] >= K:
    count+=1
  

print(count)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
N = int(N)
K = int(K)

high = list()
for i in range N-1:
  F = input()
  F = int(F)
  high.append(F)

count = 0
for j in range N-1:
  if high[j] >= K:
    count+=1
  

print(count)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
N = int(N)
K = int(K)

high = list()
for i in range N-1:
  F = input()
  F = int(F)
  high.append(F)

count = 0
for j in range N-1:
  if high[j] <= K:
    count+=1

print(count)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
N = int(N)
K = int(K)

high = list()
for i in range N-1:
  F = input()
  F = int(F)
  high[i] = F

count = 0
for j in range N-1:
  if high[j] <= K:
    count+=1

print(count)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
N = int(N)
K = int(K)

high = list()
for i in range N-1:
  F = input()
  F = int(F)
  list[i] = F

count = 0
for j in range N-1:
  if list[j] <= K:
    count+=1

print(count)

Submission status: Runtime Error

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

count = 0
def is_ok(i):
    if hi[i-1] >=K:
        return 1     
    else:
        return 0

for n in range(1, N+1):
    count += is_ok(n)

print(count)

Submission status: Runtime Error

Solution code:
N = input()
K = input()
N = int(N)
K = int(K)

high = list()
for i in range N-1:
  F = input()
  F = int(F)
  list[0] = F
count = 0
for j in range N-1:
  if list[j] <= K:
    count+=1

print(count)

Submission status: Runtime Error

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

count = 0
def is_ok(i):
    if hi[i-1] >=K:
        return 1     
    else:
        return 0

for n in range(1, N+1):
    count += is_ok(n)

print(count)

Submission status: Runtime Error

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

count = 0
def is_ok(i):
  if h[i] >=K:
    return 1
  else:
    return 0

  for n in range(i, N+1):
    count += is_ok(n)

    print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())

hi = list( kap(int, input().split()) )

count = 0
def is_ok(i):
  if h[i] >=K:
    return 1
  else:
    return 0
 
for n in range(i, N+1):
  count += is_ok(n)
  
print(count)

Submission status: Runtime Error

Solution code:
in1 = input()
in2 = input()

N,K = in1.split()

#h_list = in2.split()

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

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

print(num)

Submission status: Runtime Error

Solution code:
str1=input().split(' ')
N=int(str1[0])
K=int(str1[1])
str2=input().split(' ')
h=[]
result=0
for i in range(str2_len):
	h[i]=int(str[i])

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

print(result)

Submission status: Runtime Error

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

height = []
for _ in range(n):
    height.append(int(input()))
height.sort(reverse=True)

cnt = 0
for h in height:
    if h < min_height:
        break
    cnt += 1
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())

counter = 0
for i in range(N):
    h = int(input())
    if h >= K:
        counter += 1

print(counter)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input().split()
man = int(N[0])
border = int(N[1])
hight = input().split()
enable = 0
for i in range(man):
  if hight[i] >= border:
    enable +=1

print(enable)

Submission status: Runtime Error

Solution code:
N,K = [int(i) for i input().split()]
h = [int(i) for i 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())
l = [map(int, input().spilt())]
ans = [i if i >= K for i in l]
print(len(ans))

Submission status: Runtime Error

Solution code:
N=int(input())
K=int(input())
c=0
for i in range(N):
    h=int(input())
    if h>=K:
        c+=1

print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

h = input().split()

count = 0

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

print(count)

Submission status: Runtime Error

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

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

Solution code:
import numpy as np
N=int(input())
K=int(input())
h=[]
for i in range(N):
    h.append(int(input()))
count=0
for i in range(N):
    if h[i]>=K:
        count=count+1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

res=0

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

Submission status: Runtime Error

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

H=list(input())

cnt=0

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

Submission status: Runtime Error

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

H=list(input())

cnt=0

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

Submission status: Runtime Error

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

h.sort()

left = 0
right = len(h) - 1
center = 0

if right == 0:
    if a[0] >= K:
        print(1)
    else:
        print(0)
else:
    while right - left >= 1:
        center = int((left + right) / 2)
        if h[center] >= K:
            right = center
        else:
            left = center
        
    print(len(h) - center)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
A = 0
for i in range(N):
  x = int(input())
  if x >= K:
    A += 1
print(A)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
A = 0
for i in range(N):
  if int(input()) >= K:
    A += 1
print(A)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
A = 0
for i in range(N):
  if int(input) > K:
    A += 1
print(A)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
data1 = input().split()
data2 = input().split()

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

P = 0

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

h.sort()
i=0
while h[i]<k:
  i+=1
print(n-i)

Submission status: Runtime Error

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

h.sort()
i=0
while h[i]<k:
　　i+=1

print(n-i)

Submission status: Runtime Error

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

h.sort()
print(h[0])
i=0
while h[i]<k:
  i+=1

print(n-i)

Submission status: Runtime Error

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

h.sort()#身長をソート.デフォルトは昇順なので降順(reverse=True)としておく
i=0
while h[i]<k:
  i+=1
  
print(n-i)

Submission status: Runtime Error

Solution code:
import bisect
n = int(input())
k = int(input())
array = list(map(int,input().strip().split()))
array.sort()
index = bisect.bisect_left(array,k)
print (n - index)

Submission status: Runtime Error

Solution code:
#coding:utf-8

N = int(input())

K = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(n)

Submission status: Runtime Error

Solution code:
nk = [int(e) for e in input().split(" ")]
h = [int(f) for f in input().split()]
c = 0
for e_h in h: if nk[1] <= e_h: c += 1
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
max = int(input())
s = [input() for i in range(N)]
num = 0
for i in s:
  if i>=max:
	  num+=1
print(num)

Submission status: Runtime Error

Solution code:
N = int(input())
max = int(input())
s = [input() for i in range(N)]
num = 0
for i in s:
  if i>=max:
    num++
print(num)

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int, input().split()))
ans = [0] * n
for num, a in enumerate(A):
    ban = a + 1
    ans[ban - 2] = num + 1
ans = list(map(str, ans))
print(' '.join(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
if n % 2 == 0:
    a = n // 2
else:
    a = n // 2 + 1

print(a/n)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
h = 0
for i in range(1,N):
  if(K<=int(input())):
    h += 1
print(h)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
h = 0
for i in range(0,N):
  if(K<=int(input())):
    h += 1
print(h)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
h = 0
for i in range(0,N):
  if(K<int(input())):
    h += 1
print(h)

Submission status: Runtime Error

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