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

num = len(h)

for ht in h:
  if ht < k:
    num -= 1
print(num)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
heights = list(map(int, input().split()))
counter = 0
for height in heights:
    if height >= A[1]:
        counter += 1
print(counter)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    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)

if __name__ == '__main__':
    main()

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

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

print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect
import heapq

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

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

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


N, K = list(map(int, input().split()))
H = list(map(int, input().split()))
H.sort(reverse = True)
def main():
    res = 0
    for h in H:
        if h < K:
            return print(res)
        else:
            res+=1
    return print(N)
                
                
                
            
            
                

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

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

    print(persons)


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in range(N) :
	if l[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 sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import numpy as np
print(np.sum(K <= np.array(h)))

Submission status: Accepted

Solution code:
#N:人数、K:必要な身長、h:仲間の身長のリスト、count:ジェットコースターに乗れる人数

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
    else:
        pass
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
Created on 2019/09/28

@author: oiwaiman
'''

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:
#!/usr/bin/env python3
import sys


def solve(N: int, K: int, h: "List[int]"):
    h.sort(reverse=True)
    count = 0

    for member_cm in h:
        if member_cm >= K:
            count += 1
        else:
            pass
        if member_cm < K:
            break
        else:
            pass
    print(count)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    h = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, K, h)


if __name__ == "__main__":
    main()

Submission status: Accepted

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


ans = 0

for i in l:
    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
else:
    print(ans)

Submission status: Accepted

Solution code:
input_line=input().rstrip().split(" ")
num=int(input_line[0])
limt=int(input_line[1])

hight_line=input().rstrip().split(" ")
s=0
for i in range(num):
    hight = int(hight_line[i])
    if(hight>=limt):
        s+=1
print(s)

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=[int(x) for x in input().split()]
h=[int(x) for x in input().split()]
count=0
for i in h:
    if(K<=i):
        count+=1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import numpy as np
N,K=np.array(list(map(int, input().split())))
H  =np.array(list(map(int, input().split())))
count=0
for i in H:
    if i>=K:
        count+=1
print(count)

Submission status: Accepted

Solution code:
tmp = input()
tmp_s = [int(x.strip()) for x in tmp.split(' ')]
N = tmp_s[0] #N    
K = tmp_s[1] #K
tmp = input()
tmp_s = [int(x.strip()) for x in tmp.split(' ')]
count = 0
for i in range(N):
    if tmp_s[i] >= K:
        count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
H_i = list(map(int, input().split()))
print(len(list(filter(lambda x: K-1 < x, H_i))))

Submission status: Accepted

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

def main():
    N, K = map(int, input().split())
    x = sum((1 if h>=K else 0) for h in map(int, input().split()))

    print(x)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
def A():
    num = int(input())
    odd_nums = math.ceil(num/2.0)
    print(odd_nums/num)

def B():
    temp = [int(i) for i in input().split()]
    N = temp[0]
    K = temp[1]
    heights = [int(i) for i in input().split()]
    ans = 0
    for h in heights:
        ans += 1 if h >= K else 0
    print(ans)
    
B()

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
import bisect

def main():
    n, k, *h = map(int, open(0).read().split())
    h.sort()
    k_index = bisect.bisect_left(h, k)
    ans = n - k_index
    print(ans)
    return()

if __name__ == '__main__':
    main()

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 = [int(i) for i in input().split()]

ans = 0
for i in h_list:
  if i>=K:
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

if __name__ == "__main__":
    N = list(map(int,input().split()))
    K = N[1]
    N = N[0]
    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()))
print(len([0 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:
N,K=map(int,input().split())
h=list(map(int,input().split()))
n=sum(x>=K for x in h) 
print(n)

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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:
#code
nk=input()
nk=nk.split()
nk=list(map(int,nk))
l=input()
l=l.split()
l=list(map(int,l))
ans=0
for i in l:
    if(i>=nk[1]):
        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+=1
    else:
        ans+=0
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:
# -*- coding: utf-8 -*-

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
#        for line in sys.stdin:
#            lines.append(line)
        lines.append(input())
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n, k = [int(e) for e in lines[0].split(" ")]

    hs = [int(e) for e in lines[1].split(" ")]

    return (n, k, hs)


def solve(n, k, hs):


    result = len([h for h in hs if h >= k])

    return result


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r)
    else:
        print("%s" % result)

if __name__ == '__main__':

    main()

Submission status: Accepted

Solution code:
def solve():
    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)

solve()

Submission status: Accepted

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

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

counter = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input(): return sys.stdin.readline().strip()


def main():
    N, K = map(int, input().split())
    ans = 0
    for h in input().split():
        if int(h) >= 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()))

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 = [0]*N
h = input().split()

result = 0
for i in h:
    if int(i) >= K:
        result += 1

print(result)

Submission status: Accepted

Solution code:
# B - Roller Coaster

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

Submission status: Accepted

Solution code:
n,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())
List = list(map(int, input().split()))
counter = 0
for person in List:
  if person >= k:
    counter += 1

print(counter)

Submission status: Accepted

Solution code:

n, k = map(int, input().split())
h = [int(x) for x in input().split()]

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

Submission status: Accepted

Solution code:

NK = input().split()
h = input().split()

N = int(NK[0])
K = int(NK[1])
for i in range(N):
    h[i] = int(h[i])
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())
li = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
people = list(map(int, input().split()))
able = []

for i in people:
    if i >= k:
        able.append(i)

print(len(able))

Submission status: Accepted

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

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

for i in range(n):
    a = inp[i]
    if a >= 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 int(i) >= K: cnt += 1
print(cnt)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
h.sort(key=lambda x: -x)

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

Submission status: Accepted

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

m = 0
for i in f:
    if i >= k:
        m += 1

print(m)

Submission status: Accepted

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

count = 0
for i in range(n):
    if arr[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 = list(map(int,input().split()))
c = 0

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

Submission status: Accepted

Solution code:
import numpy as np

inputs = [int(e) for e in input().strip().split()]
n = inputs[0]
k = inputs[1]
hs = np.array([int(e) for e in input().strip().split()])
print(len(hs[hs >= k]))

Submission status: Accepted

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

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
i = 0
while i < n:
    if h[i] >= k:
        count+=1
    i+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, m = map(int, input().split())
l = list(map(int, input().split()))

ans = 0

for i in l:
    if i >= m:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
inputs1 = input().split()
n = int(inputs1[0])
k = int(inputs1[1])
inputs2 = input().split()
h = [int(s) for s in inputs2]

count = 0

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

print(count)

Submission status: Accepted

Solution code:
def main():
    _, K = map(int, input().split())
    H = list(map(int, input().split()))
    ans = 0

    for i in H:
        if i >= 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()))

Mem = 0

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

print(Mem)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

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

Submission status: Accepted

Solution code:
N, K = list(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()))
H.sort()
result = 0
for i in range(N):
  if H[i] >= K:
    result += 1
print(result)

Submission status: Accepted

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

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

h = sorted(h,reverse=True)
# print(h)
for i,v in enumerate(h):
    # print(i,v,k)
    if v<k:
        print(i)
        break
else:
    print(n)

Submission status: Accepted

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

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

NK=np.array(input().split(),dtype=np.int32)

N=NK[0]
K=NK[1]

H=np.array(input().split(),dtype=np.int32)
H=np.sort(H)[::-1]

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

print(count)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    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)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in li:
  if i>=k:
    con+=1
print(con)

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)

def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
from bisect import bisect_left

n, k = getList()
nums = getList()

ans = 0

for num in nums:
    if num >= k:
        ans += 1


print(ans)

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

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

Submission status: Accepted

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

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

print(counter)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
h = sorted(list(map(int, input().split())), reverse=True)
for num, i in enumerate(h):
    if i < k:
        n = num
        break
print(n)

Submission status: Accepted

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

print(nin)

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

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

print(count)

Submission status: Accepted

Solution code:
n, k, *h = map(int, open(0).read().split())
print(sum([1for height in h if height>=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,a=[int(s) for s in input().split()]
ls=[int(s) for s in input().split()]
x=0
for e in ls:
  if e>=a:
    x+=1
print(x)

Submission status: Accepted

Solution code:
n, k = list(map(int, input().split(' ')))
talls = list(map(int, input().split(' ')))
ans = 0
for t in talls:
  if t >= 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
    else:
        pass
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()))
ans = 0
for hi in h:
    if hi >= 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):
  if H[i] >= k:
    cnt += 1
print(cnt)

Submission status: Accepted

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

N,K = map(int,input().split())
h_list = list(map(int,input().split()))
count = 0

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

print(N-count)

Submission status: Accepted

Solution code:
n,k=map(int, input().split())
i = 0
for x in map(int, input().split()):
  if x >= k:
    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)