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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
x = filter(lambda z: z>= b, map(int, input().split()))
print(len(list(x)))

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:
from math import *

def next_int():
    return int(input())

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

n, k = next_ints()
h = next_ints()
ans = 0
for i in h:
    if i >= k:
        ans += 1
print(ans)

Submission status: Accepted

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

n = 0
for h_i in h:
  if h_i >= K:
    n += 1

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


count = 0
for i in X:
  if i >= K:
    count+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


#print(N,K)
#print(H)
count = 0
for _ in range(N):
    if H[_] >= K: count = count + 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = map(int,input().split(" "))
ar = list(map(int,input().split(" ")))
count = 0
for r in ar:
    if r >= b:
        count += 1
print(count)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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:
if __name__ == "__main__":
    num,limit=map(int,input().split())
    list = input().split()
    tmp = int()
    for i in list:
        if int(i)>=limit:
            tmp += 1
    print(tmp)

Submission status: Accepted

Solution code:
N, K, *h = map(int, open(0).read().split())
ans = len([1 for i in h if K <= i])
print(ans)

Submission status: Accepted

Solution code:
N, K, *h = map(int, open(0).read().split())
print(len([1 for i in h if K <= i]))

Submission status: Accepted

Solution code:
N, K, *h = map(int, open(0).read().split())
print(sum([1 for i in h if K <= i]))

Submission status: Accepted

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

Submission status: Accepted

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

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

    ans = 0

    for target in targets:
        if (target >= K):
            ans += 1
    print(ans)
resolve()

Submission status: Accepted

Solution code:
import sys
from functools import reduce
import copy
import math
from pprint import pprint


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    [N, K] = string_to_int(inputs[0])
    heights = string_to_int(inputs[1])
    return len(list(filter(lambda x: x >= K, heights)))


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(2))
    print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
count=0
n,k=map(int,input().split())
H=list(map(int,input().split()))
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 i in range(N):
  if h[i]>=K:
    count+=1
print(count)

Submission status: Accepted

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

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

num = 0
for i, _h in enumerate(h):
    if _h >= K:
        num = N - i
        break

print(num)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

ans = 0
member = list(map(int, input().split()))

for i in member:
    if i >= k:
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

n,k=map(int,input().split())
l=map(int,input().split())
print(sum(map(lambda x: 1 if x>=k else 0,l)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
number_of_people, required_height = [int(i) for i in input().split()]
heights = [int(i) for i in input().split()]


def counter(heights):
    res = 0
    def inner():
        nonlocal res
        for i in heights:
            if i >= required_height:
                res += 1
        return res
    return inner


solve = counter(heights)

print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def nibutanlt(n,list_a,start_index):
    if list_a[0] >= n:
        return(start_index - 1)
    elif list_a[-1] < n:
        return(len(list_a)+start_index - 1)
    temp = len(list_a)//2
    if list_a[temp] < n:
        return(nibutanlt(n,list_a[temp:],temp + start_index))
    else:
        return(nibutanlt(n,list_a[0:temp],start_index))


n,k = map(int,input().split())
h_list = list(map(int,input().split()))
ans = 0
h_list.sort()
ans = nibutanlt(k,h_list,0) + 1
print(n - ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20

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

Submission status: Accepted

Solution code:
tmp = input().split()
K = int(tmp[1])
hs = input().split()
c = 0
for hi in hs:
	if int(hi) >= K:
		c += 1
print(c)

Submission status: Accepted

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

cnt=0

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

N,K = II()
h = III()

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 = input().split()
print(sum(int(h)>=K for h in H))

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import math
import os
import sys


DEBUG = 'DEBUG' in os.environ


def inp():
    return sys.stdin.readline().rstrip()


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def main():
    N, K = [int(e) for e in inp().split()]
    H = [int(e) for e in inp().split()]
    print(len([h for h in H if h >= K]))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC142B - Roller Coaster
def main():
    N, K, *H = map(int, open(0).read().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()))

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 = input().split(" ")

sum = 0
for i in h:
    if k <= int(i):
        sum+=1
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
ans=0
fr=list(map(int,input().split()))
for i in range(n):
    if fr[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 h:
    if i >= K:
        c += 1
print(c)

Submission status: Accepted

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

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

print(len(tuple(filter(lambda x: x >= k, h))))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter
mod = 1000000007


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


def update(x, y, new_value, dp):
    if 0 <= x < len(dp) and 0 <= y < len(dp):
        dp[x][y] = min(dp[x][y], new_value)

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

Submission status: Accepted

Solution code:
# B - Roller Coaster
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 = [int(i) for i in input().split()]
count = 0
for j in range(N):
    if h[j] >= K:
        count = 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 item in h if item >= 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 = [int(i) for i in input().split()]

ans = sum(1 for x in h if x >= k)

print(ans)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


def main():
    n, k = map(int, input().split())
    hl = list(map(int, input().split()))
    print(len(list(filter(lambda h: h >= k, hl))))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

n,k = MAP()
h = MAP()
ans=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

member.sort(reverse=True)

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

input = stdin.readline
mi = lambda: map(int, input().split())
lmi = lambda: list(mi())
si = lambda: input().strip('\n')
ii = lambda: int(input())

n, k = mi()
cnt = 0
arr=lmi()
for i in arr:
    if i >= k:
        cnt+=1
print(cnt)

Submission status: Accepted

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

passengers = 0

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

print(passengers)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = A[0]
K = A[1]

a = N-1
b = 0
d = 0
for i in B:
  c = B[b]
  if K <= c:
    d = d+1
  b = b+1
print(d)

Submission status: Accepted

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

Submission status: Accepted

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

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:
NK = input().split()
N = int(NK[0])
K = int(NK[1])
h = list(map(int, input().split()))
i = 0
for j in range(N):
    if h[i] < K:
        h.pop(i)
    else:
        i = i + 1
print(len(h))

Submission status: Accepted

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

Submission status: Accepted

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

Solution code:
sum = 0
N, M = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
  if M <= A[i]:
    sum += 1
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

counter = 0
for i in A:
  if i >= K:
    counter += 1
      
print(counter)

Submission status: Accepted

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)

    over_friends = 0

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

s = 0 
for hi in h:
    if hi >= k:
        s += 1
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
num, min_height = map(int, input().split(" "))
each_height = np.array(list(map(int, input().split(" "))))

print(len(each_height[each_height >= min_height]))

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 = (int(x) for x in input().split())
h = [int(x) for x in input().split()]
answer = 0

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

print(answer)

Submission status: Accepted

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

Solution code:
N,K = list(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()))
a = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

    h = [int(x) for x in input().strip().split(" ", n)]

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

    print(count)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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

    count = 0
    for x in h:
        x = int(x)
        if x >= k:
            count += 1

    print(count)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    N,K = map(int, input().split())
    h = [1 if i >= K else 0 for i in map(int, input().split())]
    return sum(h)

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
from sys import stdin

lines = stdin.readlines()
 
N, K = map(int, lines[0].split())
H = list(lines[1].split())

cnt = int()
cnt = 0

for h in H :
  if bool( int(h) >= K ) :
    cnt += 1
  else:
    cnt += 0

print(cnt)

Submission status: Accepted

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

H = input().split(' ')
H = [int(x) for x in H if int(x) >= K]
print(len(H))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, K = map(int,input().split())

H = [int(h) for h in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for x in frei:
    if x >= k:
        ans += 1
print(ans)

Submission status: Accepted

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

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

print(ans)

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

Submission status: Accepted

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

for i in range(n):
  if listA[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()]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
print(sum([1 if K<=a else 0 for a in A]))

Submission status: Accepted

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

Submission status: Accepted

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

for i in arr:
  if i >= K:
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
n,k=[int(x) for x in input().split()]
H=[int(x) for x in input().split()]
for h in H:
  if h<k:
    n-=1
print(n)

Submission status: Accepted

Solution code:
n, k = (int(x) for x in input().split())
tall_list = list(map(int, input().split()))
member = 0
for i in tall_list :
	if k <= i :
		member += 1
	else :
		pass
	
print(member)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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())
listA = list(map(int, input().split()))

c = 0

for i in listA:
  if i >= K:
    c += 1
print(str(c))

Submission status: Accepted

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

count = 0
for i in range(N):
	if(friends[i] >= K):
		count = N-i
		break

print(count)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
l=sorted(list(map(int,input().split()))+[k])
print(n-l.index(k))

Submission status: Accepted

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

count=0
for item in l:
    if item>=K:
        count+=1
    
print(count)