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 = map(int, input().split())
h = [int(x) for x in input().split() if x>=k]
print(sum(h))

Submission status: Runtime Error

Solution code:
import re

num, lim = input().split()
x = re.split(' +', input())
if len(x) > num:
    print(0)
else:
    print(len([person for person in x if person >= lim]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

lis = []
count = 0

for _ in range(int(input())):
  lis.append(input())
  
for height in lis:
  if height >= K:
    count += 1
    
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
h = list(map(int,input().split))
h = [100,200,300,400,500]
counter = 0
for ph in h:
    if ph >= K:
        counter+= 1
print(counter)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K = list(map(int,input().split())).[:2]
height = list(map(int,input().split())).[:N]
able2ride = [a in height if a > K]
print(len(able2ride))

Submission status: Runtime Error

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

member = [ n for n in li if e >= K]
print(len(member))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <stdio.h>

int main(void)
{
  int N, K;
  scanf("%d %d", &N, &K);
  ans = 0;
  for(int i = 0; i < N; i++){
    int h;
    scanf("%d", &h);
    if(K <= h)
    	ans++;
  }
  printf("%d", ans);
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print(num)

Submission status: Runtime Error

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

print(num)

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
sum=0
for i in range(n):
  h=int(input())
  if h>=k:
    sum=sum+1
print(sum)

Submission status: Runtime Error

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

member = [ x for j in li if x >= K]
print(len(member))

Submission status: Runtime Error

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

member = [ n for n in li if e >= K]
print(len(member))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = 0

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

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
h = list(map(int, input().split()))
from bisect import bisect_left
rint(n - bisect_left(sorted(h),k))

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:
d, e = map(int, input().strip().split())
g = list(map(int, input().strip().split()))
print(d, e)
#print(g)
#total = 0
for i in g:
    if i >= e:
        total += 1
print(total)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def calculate(people_num, limit, height_array):
    permission = [height for height in height_array if height >= limit]
    return len(permission)

if __name__ == "__main__":
    input_data = '\n'.join(iter(raw_input, '')).split()
    people_num = input_data[0]
    limit= input_data[1]
    height_array = input_data[2:len(input_data)-1]
    result_num = calculate(people_num, limit, height_array)
    print(result_num)

Submission status: Runtime Error

Solution code:
def calculate(people_num, limit, height_array):
    permission = [height for height in height_array if height >= limit]
    return len(permission)

if __name__ == "__main__":
    input_data = '\n'.join(iter(raw_input, '')).split()
    people_num = input_data[0]
    limit= input_data[1]
    height_array = input_data[2:len(input_data)]
    result_num = calculate(people_num, limit, height_array)
    print(result_num)

Submission status: Runtime Error

Solution code:
def calculate(peoople_num, limit, height_array):
    permission = [height for height in height_array if height < limit]
    return len(permission)

if __name__ == "__main__":
    input_data = '\n'.join(iter(raw_input, '')).split()
    people_num = input_data[0]
    limit= input_data[1]
    height_array = input_data[2:len(input_data)]
    result_num = calculate(people_num, limit, height_array)
    print(result_num)

Submission status: Runtime Error

Solution code:
def calculate(people_num, limit, height_array):
  permit = [height for height_array if height < limit]
  return len(permit)

if __name__ == "__main__":
  input_data = '\n'.join(iter(raw_input, ''))split()
  people_num = input_data[0]
  limit= input_data[1]
  height_array = input_data[2:len(input_data)]
  result_num = calculate(people_num, limit, height_array)
  print(result_num)

Submission status: Runtime Error

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

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())
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())
ans=0
hlist=[int(input()) for i in range(n)]
for height in hlist:
  if height>=k:
    ans+=1
print(ans)

Submission status: Runtime Error

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

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 = input()
K = input()
c=0
e = []
for i in range(int(N)):
    m = input()
    e.append(int(m))
 

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

Submission status: Runtime Error

Solution code:
N = input()
K = input()
c=0

for i in range(int(N)):
    m = input()
    if int(m)>=int(K):
        c+=1

print(c)

Submission status: Runtime Error

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

for K <= hi in hi:
  print(len(hi))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, k, *h = map(int,open(0).read().split());
print(sum(h>=k for h_i in h))

Submission status: Runtime Error

Solution code:
n, k, *h = map(int,open(0).read().split())
print(sum(h>=k for h_i in h))

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
list_s=[]
list_s.append=map(int,input().split())

print(list_s>=b)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n,m = int(input().split(''))
arr = list(map(int,input().split('')))
res = 0
for i in arr:
  if i >= m:
    res += 1
return res

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(1000000000) 
N, K = input().strip().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:
people, limit = int(input().split)
counter = 0
heights = list(map(int, input().split))

for height in heights:
    if height >= limit:
        counter += 1

print(counter)

Submission status: Runtime Error

Solution code:
people, limit = int(input().split)
peopleLimit = 0
counter = 0

while peopleLimit < people:
    height = int(input())
    if height >= limit:
        counter += 1
    peopleLimit += 1

print(counter)

Submission status: Runtime Error

Solution code:
people = int(input())
limit = int(input())
peopleLimit = 0
counter = 0

while peopleLimit < people:
    height = int(input())
    if height >= limit:
        counter += 1
    peopleLimit += 1

print(counter)

Submission status: Runtime Error

Solution code:
N, K = input().strip().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 = input().split()
l = list(int(i) for i int input().split())
count = 0
 
for i in l:
  if(i > K):
    count = count + 1

print(count)

Submission status: Runtime Error

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

r_R = len(S)
r_L = 0
r_M = round( (r_R+r_L)/2 )

flag = 0

if(r_R == 1):
	flag = 1
elif(S[r_L]>=K):
  flag = 1
  r_M = r_R

while(flag==0):
  if( S[r_M] <= K < S[r_M + 1] ):
    flag = 1
  
  elif( K < S[r_M] ):
    r_L = r_M
    r_M = round( (r_R+r_L)/2 )
  
  elif( S[r_M + 1] <=K ):
    r_R = r_M
    r_M = round( (r_R+r_L)/2 )

print(r_M)

Submission status: Runtime Error

Solution code:
N, K = input().split()
l = list(int(i) for i int input().split())
count = 0

for i in l:
  if(i > K):
    count = count + 1

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = 0
for x int frie:
  if x >= k:
    ans += 1
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
f __name__ == '__main__':
    N, K = map(int, input().split())
    people_hight = list(input().split())
    ok = 0

    for person_hight in people_hight:
        if K <= int(person_hight) :
            ok = ok + 1
    print(ok)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split)
A = N
h = list(map(int, input().split()))
for hantei in h:
    if K > hantei:
        A -= 1
    else:
        pass
print(A)

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
N=map(int,input().split())
count=0
for n1 in n:
  if N>=k:
    count+=1
  ekse:
    count+=0
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
N=map(int,input().split())
count=0
for n1 in n:
  if N>k:
    count+=1
  ekse:
    count+=0
pribt(count)

Submission status: Runtime Error

Solution code:
import numpy as np
result = 0
people = int(input('people:'))
restrict = int(input('Restricted height:'))

for i in range(people):
    p1 = int(input())
    if p1 >= restrict:
        result +=1
print(result)

Submission status: Runtime Error

Solution code:
n = int(input())
k = int(input())
h = int(input())
a = []
if h >= k:
  a.append(str(h))
print(len(a))

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split)
h = list(map(int, input().split()))
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(N)

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
N=map(int,input().split())
count=0
for n1 in n:
  if N>k:
    count+=1
  ekse:
    print(0)
pribt(count)

Submission status: Runtime Error

Solution code:
N, K = 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 = int(input())
k = int(input())
h = int(input())
a = []
if h >= k:
  a.append(h)
  print(len(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

x = input()
hights_str = input()

low_limit = int(x.split(" ")[1]
hights = map(int, hights_str.split(" "))

count = 0
for hight in hights:
    if hight >= low_limit:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
n,k = list(map(int,input().split()))
s = 0 

for i in range(n):
    h = int(input())
    if h >= k:
        s += 1
print(s)
exit(0)

Submission status: Runtime Error

Solution code:
n, k = map(int, input().split())
h_1 h_2 h_3 ... h_n
h = list(map(int, inpnt().split())) 
h_refined = [ i for i if i >=  k]
print(len(h_refined))

Submission status: Runtime Error

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

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

for i in range(len(b)):
    for j in range(len(b)):
        if b[i]<b[j]:
            x = b[i]
            b[i] = b[j]
            b[j] = x
c = 0
for k in b:
    if k < K:
        break
    c += 1

print c

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=input().split()
k = int(k)
h = int(input()
a = []
  if h > k:
    a.append(h)
    print(len(a))

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split)
h = map(int, input().split())
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(N)

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

count = 0
for n in ar:
    if n >= K:
        count += 1

print(count)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split)
h = list(map(int, input().split()))
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(str.N)

Submission status: Runtime Error

Solution code:
import math

if __name__ == '__main__':
    n, k = map(int, input().split())
    heights = list(map(int, input().split()))
    heights.sort()
    # n人、k CM必要
    index = 0
    while heights[index] < k:
        index += 1
        if n == 1:
            break
    print(n - index)

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
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 = map(int, input().split())
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(str.N)

Submission status: Runtime Error

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

h = int(input())

a = list()
b = list()

for _ in range(h):
    a.append(input())
for row in a:
  if row > k:
    b.append(row)
    print(len(b))

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
li=[]
count=0
for i in range(0,n):
  num=int(input())
  li.append(num)
for j in range(0,n):
  if li[j]>=k:
    count=count+1
print(count)

Submission status: Runtime Error

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

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

print(c)

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split)
h = []
for hantei in h:
    if K > hantei:
        N -= 1
    else:
        pass
print(str.N)

Submission status: Runtime Error

Solution code:
x,y = map(int,input().split())	
c=input()
c.split()
print(y)
count=0
for i in c:
    if(float(y) <= float(i)):
        count+=1
print(count)

Submission status: Runtime Error

Solution code:
n = int(input())
k = int(input())
count = 0
for i in range(n):
    if int(input()) >= k:
        count += 1

print(count)

Submission status: Runtime Error

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

print(sum(h>K for h in H_i)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
from collections import Counter, deque, defaultdict
from math import factorial
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
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()))

n, k = INT()
h = LIST()
count = 0
for i in h:
    if i >= k:
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
N, K=map(int, input())
a=1
T=0
if a<=N:
	a+=1
	P=input()
    if P>=K:
		T+=1
print(T)

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 h[i] >= k:
ans += 1

print(ans)

Submission status: Runtime Error

Solution code:
import numpy as np
 
N, K = map(int, input().split())
h_i = np.array(map(int, input().split()))

can_ride = h_i[h_i>=K]
print(len(can_ride))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

can_ride = h_i[h_i>=K]
print(len(can_ride))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

# N=1
# K=500
# h_list=[499]

person = 0
for n in range(N):
    if int(h_list[n]) >= K:
        person+=1
    
print(person)

Submission status: Runtime Error

Solution code:
N, K = input().strip().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:
import numpy as np

N = int(input())
K = int(input())
h_i = np.array(map(int, input().split()))

can_ride = h_i[h_i>=K]
print(len(can_ride))

Submission status: Runtime Error

Solution code:
NK = input().split('')
N = int(NK[0])
K = int(NK[1])
h_list = input().split('')
h_list = [int(x) for x in hlist]

# N=1
# K=500
# h_list=[499]

person = 0
for n in range(N):
    if h_list[n] >= K:
        person+=1
    
print(person)

Submission status: Runtime Error

Solution code:
args = []
a = input()
while a:
  for x in a.split():
    args.append(int(x))
  a = input()

b = [x for x in args[2:] if x >= args[1]]
print(len(b))

Submission status: Runtime Error

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

H =  []
for i in range(N)
 H += [int(input())]

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

Submission status: Runtime Error

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

# N=1
# K=500
# h_list=[499]

person = 0
for n in range(N):
    if h_list[n] >= K:
        person+=1
    
print(person)

Submission status: Runtime Error

Solution code:
N,K = input().split()
n = int(N)
k = int(K)
hList = []

for i in range(0,n):
    hList.append(int(input()))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
k =int(input()) 
count=0
for i in range(n):
  x=int(input())
  if x>=k:
    count=count+1
print(count)

Submission status: Runtime Error

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

print(sum([1 if K<=a else 0 for a in A])

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
K = int(input())
h_i = np.arry(input().split()) 

can_ride = h_i[h_i>=K]
print(len(can_ride))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(goukei)

Submission status: Runtime Error

Solution code:
import numpy as np

N = int(input())
K = int(input())
h_i = map(int,input().spilt())

can_ride = h_i[h_i>=K]
print(len(can_ride))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = [int(x) for x in input().split()]
y = [int(x) for x in input().split()]
c=0
for i in range(x[0]):
  if y[i]>=x[1]:
    c++
    continue
print(c)

Submission status: Runtime Error

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

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[n] >= k:
    count += 1
print(count)

Submission status: Runtime Error

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


def solve(N: int, K: int, h: "List[int]"):
    persons = 0

    for _h in h:
        if _h >= K:
            persons += 1

    print(persons)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    h = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, K, h)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

def gr(n,k):
    br=0
    for i in range(n):
        g=int(input())
        if g>=k:
            br=br+1
    return br
print(gr(n,k))

Submission status: Runtime Error

Solution code:
x = [int(x) for x in input().split()]
y = [int(x) for x in input().split()]
c=0
for i in range(x[0]):
  if y[i]>=x[1]:
    c++
print(c)

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
br=0
for i in range(n):
    g=int(input())
    if g>=k:
        br=br+1

print(br)

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+=1
print(count)

Submission status: Runtime Error

Solution code:
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <iostream>
#include <cctype>
#include <ctime>
#include <set>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <utility>
#include <string>
#include <map>
#define ll long long

using namespace std;

const int M = 1000000007;

int n, k, c, x;

int main() {

	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	
	cin >> n >> k;
	
	for (int i = 0; i < n; i++){
		cin >> x;
		if (x >= k) c++;
	}
	
	cout << c;
	
return 0;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

h = [int(input()) for i in range(n)]

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

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

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, m = [int(i) for i in input().split()]
cnt = 0
for i in input().split();
	if m <= int(i):
    	cnt += 1
print(cnt)

Submission status: Runtime Error

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

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