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: Wrong Answer

Solution code:
NK = input().split()
hs = input().split()
ans = 0
for i in range(0, int(NK[0])):
    if int(hs[i]) > int(NK[1]):
        ans += 1

print(ans)

Submission status: Wrong Answer

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

count = 0

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

Submission status: Wrong Answer

Solution code:
N,K = [int(x) for x in 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: Wrong Answer

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

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
print(len(list(filter(lambda x:x>k,a))))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N, K, *h = open(0).read().split()
print(sum(1 for i in filter(lambda x: K <= x, h)))

Submission status: Wrong Answer

Solution code:
numbers = input().rstrip().split(" ")
members = input().rstrip().split(" ")
number =int(numbers[0])
standard =int(numbers[1])
rist =sorted(members, reverse=True)
i = 0
while standard<=int(rist[i]):
  i=i+1
  if i==number:
    break
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(N)
print(K)
print(b)

passengers = 0

for i in b:
  if int(i) >= K:
    passengers += 1

print(passengers)

Submission status: Wrong Answer

Solution code:
a = input().split()
b = input().split()

N = a[0]
K = a[1]

passengers = 0

for i in b:
  if i >= K:
    passengers += 1

print(passengers)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 天気の入力
N, K = input().split()
h_list = input().split()
count = 0
for h in h_list:
    if(h >= K):
        count += 1
# 出力

print(count)

Submission status: Wrong Answer

Solution code:
numbers = input().rstrip().split(" ")
members = input().rstrip().split(" ")
number =int(numbers[0])
standard =int(numbers[1])
rist =sorted(members, reverse=True)
i =0
while standard<=int(rist[i]):
  i=i+1
  if i==number:
    break
print(i)

Submission status: Wrong Answer

Solution code:
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    for i in range(friends):
        if sorted_heights[i] < min_height:
            continue
        else:
            print(friends - i)
            break

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

Solution code:
NK = input().split()
N = int(NK[0])
K = int(NK[1])
h = list(map(int, input().split()))
for j in range(N):
    i = 0
    if h[i] < K:
        h.pop(i)
    else:
        i = i + 1
print(len(h))

Submission status: Wrong Answer

Solution code:
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    for i in range(len(sorted_heights)):
        if sorted_heights[i] < min_height:
            continue
        print(len(sorted_heights) - i)
        break

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s = raw_input().split()
[N, K] = s
N = int(N)
K = int(K)
#print N, K

s = raw_input().split()
#print s
h = [0]*N

for i in range(N):
    h[i] = int(s[i])
    #print h[i]

h.sort(reverse=True)
print h

for i in range(N):
    if (h[i] >= K):
        continue
    else:
        print i
        exit()

print N

Submission status: Wrong Answer

Solution code:
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = l[1]

    h = input().strip().split(" ", n)

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


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = l[1]

    h = input().strip().split(" ", n)

    r = [x for x in h if x >= k]
    print(r.__len__())


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N, K = list(map(int, input().split(" ")))
h = sorted(list(map(int, input().split(" "))))
h_ = list(h)
n = lambda :len(h_)
while n() > 1: h_ = h_[n()//2:] if h_[n()//2] < K else h_[:n()//2]
if h_[0] < K: print(h[::-1].index(h_[0]))
else: print(h[::-1].index(h_[0])+1)

Submission status: Wrong Answer

Solution code:
def main():
    l = input().strip().split(" ")
    n = l[0]
    k = l[1]

    h = input().strip().split(" ")

    r = [x for x in h if x >= k]
    print(r.__len__())


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N, K = list(map(int, input().split(" ")))
h = sorted(list(map(int, input().split(" "))))
h_ = list(h)
n = lambda :len(h_)
while n() > 1:
    h_ = h_[n()//2:] if h[n()//2] < K else h_[:n()//2]

if h_[0] < K: print(h[::-1].index(h_[0]))
else: print(h[::-1].index(h_[0])+1)

Submission status: Wrong Answer

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

N, K = input().split()
height_list = input().split()
count = sum(h>=K for h in height_list)
print('{}'.format(count))

Submission status: Wrong Answer

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

N, K = input().split()
height_list = input().split()
count = sum([1 for h in height_list if h>=K])
print('{}'.format(count))

Submission status: Wrong Answer

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: Wrong Answer

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

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

b = [5,3,6,2,4,6]
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: Wrong Answer

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

N, K = input().split()
height_list = input().split()
count = sum([1 for h in height_list if h>K])
print('{}'.format(count))

Submission status: Wrong Answer

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

h.sort(reverse=True)
ans = 0
flag = True
if h[n-1]>k:
	ans = n
	flag = False
if h[0] < k:
	ans = 0
	flag = False
  
if flag == True:
	for i in range(0,n):
		if h[i] < k:
			ans = len(h[:i])
			break

print(ans)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

N, K = input().split()
height_list = input().split()
count = 0
for h in height_list:
    if h >= K:
        count += 1
print('{}'.format(count))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
rule = input().split()
men = input().split()

mens = 0
for i in men:
  if int(rule[0]) <= int(i):
    mens += 1

print(mens)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=(int(x) for x in input().split())
X=input()
Y=X.split()
count=0

for i in range(len(Y)):
    if b<int(Y[i]):
        count=count+1
    ++i
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

h.sort(reverse=True)
ans = 0
flag = True
if h[n-1]>k:
	ans = n
	flag = False
if h[0] < k:
	ans = 0
	flag = False
  
if flag == True:
	for i in range(0,n-1):
		if h[i] < k:
			ans = len(h[:i])
			break
  
    
print(ans)

Submission status: Wrong Answer

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

for i in range(len(h)):
    if h[i] >= k:
        # print(i,h[i])
        print(len(h) -i)
        exit(0)

Submission status: Wrong Answer

Solution code:
str = input().split()

n = int(str[0])
k = int(str[1])

str2 = input().split()

c = 0

for s in str2:
    i = int(s)
    if i > k:
        c += 1

print(c)

Submission status: Wrong Answer

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 = math.floor(n / 2)
    if heights[index] < k:
        # indexのやつは小さいので右を見る
        while True:
            if index < n and heights[index] < k:
                index += 1
            else:
                break
    else:
        while True:
            if heights[index] > k:
                if index == 0:
                    break
                index -= 1
            else:
                break
    print(n - index)

Submission status: Wrong Answer

Solution code:
A = input().split()
B = input().split()
count = 0
for i in B:
    if i >= A[1]:
        count += 1

print(count)

Submission status: Wrong Answer

Solution code:
import numpy as np
N = list(map(int, input().split()))
A = list(map(int, input().split())) 
numb = N[0]
bord = N[1]

A_p =np.array(A)
count =0

for n in range(numb):
    if A_p[n] > bord:
        count +=1
        
print(count)

Submission status: Wrong Answer

Solution code:
str = input().split()

n = int(str[0])
k = int(str[1])

str2 = input().split()

c = 0

for s in str2:
    i = int(s)
    if i < k:
        c += 1

print(c)

Submission status: Wrong Answer

Solution code:
numbers = input().rstrip().split(" ")
members = input().rstrip().split(" ")
#print(numbers)
#print(members)
number =int(numbers[0])
standard =int(numbers[1])
rist =sorted(members, reverse=True)
#print(rist)
i =0
while standard<=int(rist[i]):
  i=i+1
  if i==number:
    break
print(i)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 1, 0
while i <= len(h):
  if h[-i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Submission status: Wrong Answer

Solution code:
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 1, 0
while i <= int(n):
  if h[-i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 0, 0
while i < len(h):
  if h[-i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
N,K = input().split()
H = input().split()
print(sum([1 for h in H if h>=K]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

h=input().split()
n=0
for i in range(int(N)):
	tmph=h[i]
	if tmph >=K:
		n=n+1

print(n)

Submission status: Wrong Answer

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

result = 0
h = map(int, input().split())
for i in h:
    if i >= K:
        result += 1
print(result)

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 0, 0
while i < int(n):
  if h[i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        #または、quit(),os.exit()をして止める。

print(listA[0],listA[1])
N,K=listA[0]
count=0
for h in listA[1]:
  if(K<=h):
    count=count+1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

def main():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    print(N, K, h)
    print(sum(1 for i in h if i >= K))


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort()
cnt=0
for i in range(n):
	if h[i]>=k:
		cnt=i
		break
print(n-cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(count)

Submission status: Wrong Answer

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: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

h.sort()

for i in range(len(h)):
  if max(h) < k:
    ans = 0
    break
  elif h[i] >= k:
    ans = len(h[i:])
    break
  
    
print(ans)

Submission status: Accepted

Solution code:
# 高橋君の仲間たちは N 人で遊園地に遊びにいきました。 遊園地の一番人気のジェットコースターに乗るためには、身長が K cm以上必要です。
# 高橋君の i 番目の仲間の身長は h i cm です。 高橋君の仲間たちのうち、一番人気のジェットコースターに乗ることができる人の数を求めてください。

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

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
num_list = [num for num in map(int, input().split()) if num >= y]
print(len(num_list))

Submission status: Accepted

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

answer = 0

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

print(answer)

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 h in H:
  if h >= k:
    ans += 1

print(ans)

Submission status: Accepted

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

cnt = 0
for i in l:
    if i >= K:
        cnt = cnt + 1

print(cnt)

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:
# Kより大きいやつを抽出してlenで要素を返す
N, K = map(int, input().split())
h = list(map(int, input().split()))

possible = []

for i in h:
    if i >= K:
        possible.append(i)

print(len(possible))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
H = tuple(map(int, input().split()))
assert len(H) == N
print(len([h for h in H if h >= 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())
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:
from bisect import bisect_left
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
i = bisect_left(h, k)
print(n-i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
cnt = 0
for hi in h:
  if hi >= 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 h:
  if 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(np.count_nonzero(h-k>=0))

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

for i in range(n):
    cnt += H[i] >= k

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 k<=i:
        ans+=1
print(ans)

Submission status: Accepted

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

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

print(o)

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

# n = int(input())
# s = [map(int, input()) for i in range(3)]

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

print(n-count)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
H = list(map(int, input().split()))
count = 0
for h in H:
    if h >= K:
        count = 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())
friend = list(map(int,input().split()))
clear = []

for i in friend:
    if i >= K:
        clear.append(i)

print(len(clear))

Submission status: Accepted

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

for i in lst:
    if i >= K:
        ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
total_people, min_height = map(int, input().split())
height = map(int, input().split())
rideable_people = 0
for i in height:
    if i >= min_height:
        rideable_people += 1
print(rideable_people)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

cn = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mem_num, over_height = map(int, input().split())
members_hgt = list(map(int, input().split()))
cnt = 0

for i in members_hgt:
    if i >= over_height:
        cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

def answer(n: int, k: int, h: list) -> int:
    ans = 0
    for i in range(0, n):
        if h[i] >= k:
            ans += 1
    return ans

print(answer(n, k, h))

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:
n, k = map(int, input().split())
list01 = input().split()
list02 = [int(a) for a in list01]
x = 0
for i in list02:
    if i >= k:
        x += 1
    else:
        pass
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

data = list(map(int,input().split()))
cnt =0

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

Submission status: Accepted

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

# N人で遊園地に遊びにいきました。
# ジェットコースターに乗るためには、身長が Kcm以上 必要です。
# 高橋君の仲間たちのうち、一番人気のジェットコースターに乗ることのできる人の数を出力してください。

availability = 0

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

print(availability)

Submission status: Accepted

Solution code:
# B - Roller Coaster

#  N K
N, K = map(int, input().split())
my_list = list(map(int, input().split(maxsplit=N)))
answer = 0

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

print(answer)

Submission status: Accepted

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

ANS = sum(x >= K for x in H)
print(ANS)

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

answer = sum(i >= K for i in h)

print(answer)

Submission status: Accepted

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

result = 0

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

Submission status: Accepted

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

count = 0
for x in friend:
  if x >= k:
    count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
h = list(map(int,input().split()))
# ジェットコースターの乗れる人の数
able_num = 0
# リスト内の数字を取り出して、ｋより大きければ乗れる人をカウントアップ
for i in h:
    if i >= k:
        able_num += 1
print(able_num)

Submission status: Accepted

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

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

ans = sum(x>=k for x in l)
print(ans)