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

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

x = 0
for hh in h:
    if hh >= k:
        x += 1
print(x)

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 = list(map(int, input().split()))
ans = len([1 for h in H if h >= K])
print(ans)

Submission status: Accepted

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

ac = [H[i] for i in range(len(H)) if H[i] >= K]
print(len(ac))

Submission status: Accepted

Solution code:
import math

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

count = 0
for i in range(n):
  if height[i]>=limit:
    count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=[int(i) for i in input().split()]
h=[int(i) for i in 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()))
h.sort()
for i in range(N):
    if h[i] >= K:
        print(len(h[i:]))
        exit()
print(0)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
a,b=map(int, input().split())
c=list(map(int, input().split()))
count = 0

for i in range(a):
  if c[i] >= b:
    count +=1
    
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    ans = sum([i>=k for i in h])
    print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b=map(int,input().split())
c=list(map(int,input().split()))
d=0
for i in range(a):
  if c[i]>=b:
    d+=1
print(d)

Submission status: Accepted

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

Submission status: Accepted

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

print(sum)

Submission status: Accepted

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

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 = 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:
import bisect

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

h.sort()

n = bisect.bisect_left(h, K)

print(N - n)

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

Submission status: Accepted

Solution code:
import numpy as np

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

H = np.array(H)

ans = len(H[H>=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 h:
  ans += (i >= k)
print(ans)

Submission status: Accepted

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

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())
h = list(map(int, input().split()))

h.sort()
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())
h = list(map(int,input().split()))

def compare(num, d):
    ''' 
    num >= d --> true
    d < num --> false
    '''
    if num >= d:
        return True
    else:
        return False
ans = 0
for x in h:
    if compare(x,k):
        ans += 1
print(ans)

Submission status: Accepted

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

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:
#B
import bisect

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

h.sort()

a = bisect.bisect_left(h,k)

print(len(h) - 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:
n,k = map(int, input().split())
h = [int(_) for _ in input().split()]
print(len([i for i in h if i>=k]))

Submission status: Accepted

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

isGraterThanN = lambda n: lambda value: value >= n
isGraterThanK = isGraterThanN(K)

h_grater_then_k = filter(isGraterThanK, h)
h_grater_then_k = list(h_grater_then_k)

answer = len(h_grater_then_k)
print(answer)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from itertools import *
from collections import *

INF = float('inf')

""" Input
S = input().rstrip()
N = int(input())
D = [int(input()) for _ in range(N)]
"""

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

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""
  
def main():
  n,k = map(int,input().split())
  LIST = list(map(int,input().split()))
  cnt = 0
  for i in range(n):
    if LIST[i] >= k:
      cnt +=1
  print(cnt)
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
n, k, *h = map(int, open(0).read().split())

cnt = 0
for hight in h:
    if k <= hight:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
N,K,*H,=map(int,open(0).read().split());A=0
for i in H:A+=1*(i>=K)
print(A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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()))
res=0
for i in range(n):
  if h[i]>=k:
    res+=1
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))
ret = 0
for i in h:
    if i >= k:
        ret+=1
print(ret)

Submission status: Accepted

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

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=[]
h=list(map(int, input().split()))
count=0

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

print(count)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n,k=INTM()
    l=LIST()
    ct=0
    for i in range(n):
        if l[i]>=k:
            ct+=1
    print(ct)
if __name__ == '__main__':
    do()

Submission status: Accepted

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

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

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

h = sorted(h)

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = [int(x) for x 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())
h=list(map(int,input().split()))
print(sum(i>=K for i in h))

Submission status: Accepted

Solution code:
n, k = [int(i) for i in input().split()]
h = [int(i) for i in 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=n
for i in range(n):
  if h[i]<k:
    ans-=1
print(ans)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,k = iim()
h = iil()

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

Submission status: Accepted

Solution code:
import sys

input=sys.stdin.readline

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

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

print(ans)

Submission status: Accepted

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

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

print(len([m for m in members if m >= K]))

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=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:
import sys
input = sys.stdin.readline

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

print(sum([1 for x in h if x >= K]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, K = lr()
H = np.array(lr())
answer = np.count_nonzero(H >= K)
print(answer)

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:
import sys
input = sys.stdin.readline

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:
_, k = map(int, input().split())
print([i >= k for i in list(map(int, input().split()))].count(1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC142.B
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
print(count)

Submission status: Accepted

Solution code:
n,k = [int(x) for x in input().split()]
h = [int(x) for x in 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 h:
    if i >= K:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:

def solve():
    n, k = map(int, input().split())
    H = map(int, input().split())

    sm = 0
    for h in H:
        if h >= k:
            sm = sm + 1

    print(sm)



if __name__ == '__main__':
    solve()

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:
N,K = map(int,input().split())
h = list(map(int,input().split()))
h.sort(reverse = True)
ans = 0
for i in range(N):
  if h[i] >= K:
    ans += 1
  else:
    break
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()))

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

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

Submission status: Accepted

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

for i in range(n):
    if h[i] < k:
        c = c + 1
    else:
        print(n - c)
        exit()
print(n - c)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def get_ints():
    return map(int, input().split())

n, k = get_ints()
hs = get_ints()
ans = 0
for h in hs:
    if h >= k:
        ans += 1

print(ans)

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
h.sort()

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

print(count)

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nk=input().rstrip().split(" ")
n=int(nk[0])
k=int(nk[1])
leng=input().rstrip().split(" ")
count=0
for hei in leng:
    if int(hei)>=k:
        count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

x=0
for a in aa:
  if a >=k:
    x+=1
print(x)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
#!/usr/bin/env python3
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()))
print (len([1 for x in h if x >= 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:
#142_B
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 = [int(i) for i in input().split()]
h = [int(i) for i 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 = 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 = list(map(int,input().split()))
people = 0
for i in h:
  if i >= k:
    people += 1
print(people)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    N, K = input_nums()
    H = input_nums()
    res = len([h for h in H if h >= K])
    print(res)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    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)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(sum)

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()))
print(len([i for i in h if i >= K]))

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b=map(int,input().split())
height=list(map(int,input().split()))
count=0
for i in range (a):
  	 if int(height[i])>=b:
  	 	count+=1
print(str(count))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: 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())
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,y=list(map(int, input().split()))
z=list(map(int, input().split()))
count=0
for i in range(x):
	if z[i]>=y:
		count=count+1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#a,b = map(int,input().split())
#A = list(map(int,input().split()))
# S = str(input())
# if('L' in S[0::2] or 'R' in S[1::2]):
#     print('No')
# else:
#     print('Yes')
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 h:
    if i>=k: ans+=1
print(ans)

Submission status: Accepted

Solution code:
#スペース区切りの整数の入力
N, K = map(int, input().split())

#複数の入力
input_list = input().split( )

counter = 0
for i in range(N):
  if(int(input_list[i])>=K):
    counter = counter + 1
  else:
    counter = counter
print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

print(ing_total)

Submission status: Accepted

Solution code:
_, k, *h = map(int, open(0).read().split())
print(sum([i >= k for i in h]))

Submission status: Accepted

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

Submission status: Accepted

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

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] = list(map(int,input().split()))
ls_h = list(map(int,input().split()))

count=0
for i in range(N):
    if ls_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:
def solve():
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
    l = list(filter(lambda x: x >= M, A))
    return len(l)

print(solve())

Submission status: Accepted

Solution code:
def solve():
    N, M = map(int, input().split())
    A = list(map(int, input().split()))
    c = 0
    for a in A:
        if a >= M:
            c+=1
    return c

print(solve())