Problem:


Score : 200 points

Problem Statement

N friends of Takahashi has come to a theme park.

To ride the most popular roller coaster in the park, you must be at least K centimeters tall.

The i-th friend is h_i centimeters tall.

How many of the Takahashi's friends can ride the roller coaster?

Constraints

 1 \le N \le 10^5 

 1 \le K \le 500 

 1 \le h_i \le 500

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N K
h_1 h_2 \ldots h_N

Output

Print the number of people among the Takahashi's friends who can ride the roller coaster.

Sample Input 1

4 150
150 140 100 200

Sample Output 1

2

Two of them can ride the roller coaster: the first and fourth friends.

Sample Input 2

1 500
499

Sample Output 2

0

Sample Input 3

5 1
100 200 300 400 500

Sample Output 3

5



Sample input:
4 150
150 140 100 200


Sample output:
2

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def roller_coaster():
	
	N = list(map(int,input().split()))
	h = list(map(int,input().split()))
	
	print(sum(x >= N[1] for x in h))
 

if __name__=='__main__':
	
	roller_coaster()

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

Num, Height = [int(x) for x in sys.stdin.readline().rstrip().split()]

list_result = [i for i in list(sys.stdin.readline().rstrip().split()) if int(i) >= Height]

print(len(list_result))

Submission status: Accepted

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

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

r1 = 0

for i1 in range(n1):
    if n3[i1] >= n2:
        r1 += 1

print(r1)

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N,K = (int(i) for i in input().split() )
h_list = [int(i) for i in input().split()]
counter = [ i for i in h_list if i >= K ]
print( len(counter) )

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

h.sort()
h = h[::-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n, k = map(int, input().split(" "))
h = np.array(list(map(int, input().split(" "))))
a = np.where(h >= k)[0]
ans = len(a)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
hi = map(int, input().split())
S = N
for value in hi:
    if value < K:
        S -= 1
print(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = N
for i, h_i in enumerate(h_sorted):
    if h_i < K:
        ans = i
        break
print(ans)

Submission status: Accepted

Solution code:

import bisect

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

H.sort()

idx = bisect.bisect_left(H, K)

print(N-idx)

Submission status: Accepted

Solution code:
num = [int(e) for e in input().split()]
men = [int(e) for e in input().split()]

N = num[0]
K = num[1]
i = 0
J = []
while i<=(N-1):
    if men[i]>= K:
        J.extend([i])
    i += 1
can = int(len(J))
print(can)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Contest: AtCoder Beginner Contest 142 (https://atcoder.jp/contests/abc142)
# Problem: B: Roller Coaster (https://atcoder.jp/contests/abc142/tasks/abc142_b)

def rint():
    return int(input())


def rints():
    return list(map(int, input().split()))


n, k = rints()
c = 0
for hi in rints():
    c += hi >= k
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len(h_))

Submission status: Accepted

Solution code:
line = input().split(" ")
n, k = int(line[0]), int(line[1])

line = input().split(" ")

ans = 0
for e in line:
	if int(e) >= k:
		ans += 1

print(ans)

Submission status: Accepted

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: Accepted

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

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

c = 0

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K=(int(x) for x in input().split())
count=0
height_list=input()
height_list=height_list.split(" ")
for i in height_list:
    height=int(i)
    if(height>=K):
        count+=1
print(count)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4000000)

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

c = 0
for height in h:
    if height>=k:
        c += 1
print(c)

Submission status: Accepted

Solution code:
import numpy

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

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

print(result)

Submission status: Accepted

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


#h_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: Accepted

Solution code:
n, min_height = map(int, input().split())
height = list(map(int, input().split()))
height.sort(reverse=True)

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

Submission status: Accepted

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

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

counter=0

for i in H:
    if i>=K:
        counter+=1

print(counter)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count=0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
N,K=raw_input().split()
HI=raw_input().split()

n = int(N)
k = int(K)
hi = [int(i) for i in HI]

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc142/tasks/abc142_b
# -*- coding: utf-8 -*-

get_str = list(map(int, input().strip().split()))
friend_cnt = get_str[0]
toll_thr = get_str[1]
atoll_val = list(map(int, input().strip().split()))

ok_cnt = 0
for i in range(friend_cnt):
    if atoll_val[i] >= toll_thr:
        ok_cnt += 1

print(ok_cnt)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 18,Oct,2019
"""

import sys
input = sys.stdin.readline

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

ans = 0
print(len([i for i in lis if i >= K]))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

height = sorted(height)

cnt = 0
for i in range(n):
    if height[i] >= k:
        break
    else:
        cnt += 1

print(n - cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(x>=k for x in N))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
people = list(map(int, input().split()))
def eligible_roller(N, K, p):
    return len(list(filter(lambda x: x >= K, people)))

print(eligible_roller(N, K, people))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input().split(' ')
b=input().split(' ')
m=int(a[1])
b=[int(x) for x in b]
print(len([0 for x in b if x>=m]))

Submission status: Accepted

Solution code:
import sys

input_line = input()
N, K = int(input_line.split(' ')[0]),int(input_line.split(' ')[1])

input_line = input()
height = list(map(int,input_line.split()))

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

Submission status: Accepted

Solution code:
import fileinput
for i, line in enumerate(fileinput.input()):
  if i == 0:
    N, K = map(int, line.strip().split())
  else:
    hs = map(int, line.strip().split())
    print(sum([1 for h in hs if h >= K]))
    break

Submission status: Accepted

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

c = 0

for h in h_list:
  if h >= k:
    c += 1
  
print("{}".format(c))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

s = input().split()
N=int(s[0])
K=int(s[1])

s=(input().split())
index=0

for n in range(N):
    if int(s[n]) >= K:
        index +=1

print(index)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

counter = 0

for i in range(NK[0]):
    if h_list[i] >= NK[1]:
        counter += 1

print(counter)

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 = input().split()
man = int(N[0])
border = int(N[1])
hight = input().split()
enable = 0
for i in range(man):
  if int(hight[i]) >= border:
    enable +=1
print(enable)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
l=list(map(int,input().split()))
l.sort(reverse=True)
count1=0
for i in l:
  if(i<k):
    break
  count1=count1+1
print(count1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

N,K=[int(c) for c in input().split()]
H=[int(c) for c in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

rst = sum(i >= K for i in h)
print(rst)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

def func(num, need_height, heights):
    answer= 0
    for i in range(num):
        if(heights[i]>=need_height):
            answer += 1

    print(answer)


def main():
    n,k = [int(i) for i in input().split()] 
    h = list(map(int, input().split()))
    func(n,k,h)
    
# main関数呼び出し
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

n,k = map(int,input().split())
h = np.array(input().split()).astype(np.int)

print(sum(hi >= k for hi in h))

Submission status: Accepted

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

print(c)

Submission status: Accepted

Solution code:
import numpy as np

nk = input().split()
n = int(nk[0])
k = int(nk[1])
h = np.array(input().split()).astype(np.int)

print(sum(hi >= k for hi in h))

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

h = list(map(int, input().split()))[::-1]

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

print(ans)

Submission status: Accepted

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

answer = 0

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

print(answer)

Submission status: Accepted

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

count = 0

for i in a:
    if i>= k:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split()]
h_list = [int(x) for x in input().split()]
cnt = 0
for h in h_list:
    cnt += (h >= K)
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
for i in List:
    if i >= k:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

    print(count)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ki = sorted(ki)
n = sum(x>=K for x in ki)
print(n)

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

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

cnt=0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cn = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
#ABC142 B - Roller Coaster

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

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

count = 0

for j in h:
    if j >= K:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

for i in h:
    if K <= i:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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