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:
import sys

lines = sys.stdin.readlines()
n, k = map(int, lines[0].split())
print(len(list(filter(lambda h : h >= k, map(int, lines[1].split())))))

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

h.sort()

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

print(ans)

Submission status: Accepted

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

cnt = 0
for elem in input().split():
    if int(elem) - k >= 0:
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


# Run main
if __name__ == '__main__':
    AtCoder().main()

Submission status: Accepted

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

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

ans = 0

for a in ls:
  if a >=k:
    ans +=1
print(ans)

Submission status: Accepted

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

ct = 0

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

print(ct)

Submission status: Accepted

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

ans = 0
for hi in h:
    if hi >= k:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq

mod = 1e9+7

def swap(a,b):
    return (b,a)

def gcd(a,b):
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a):
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def main():
    n,k = map(int,input().split())
    ans = 0
    h = [x for x in map(int,input().split())]
    for i in h:
        if i>=k:
            ans += 1
    print(ans)
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

n,k = [int(x) for x in stdin.readline().rstrip().split()]

li = list(map(int,stdin.readline().rstrip().split()))

point = 0

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

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline().strip()
INF = 10 ** 18
MOD = 10 ** 9 + 7

debug = True
debug = False

def dprint(*objects):
    if debug == True:
        print(*objects)

def solve():
    N, K = LI()
    h_list = LI()

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

solve()

Submission status: Accepted

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

a=0
for i in h:
	if i>=k:
		a+=1

print(a)

Submission status: Accepted

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

count = 0 
for hi in hh:
  if hi >= 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())

can_ride_num = 0
for h in h_list:
    if h >= k:
        can_ride_num += 1

print(can_ride_num)

Submission status: Accepted

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

c = 0
for h in h_list :
    if (h >= K) :
        c += 1

print(c)

Submission status: Accepted

Solution code:
# from math import factorial
# from collections import defaultdict, deque
#  from heapq import heappush, heappop, heapify

# A, B = [int(i) for i in input().split(" ")]
# A = int(input())
# As = [int(i) for i in input().split(" ")]
# Ss = ["".join(sorted(input())) for _ in range(N)]
# edges = defaultdict(list)
# for _ in range(N - 1):
#     a, b = [int(i) for i in input().split(" ")]
#     edges[a-1].append(b-1)

N, K = [int(i) for i in input().split(" ")]
Hs = [int(i) for i in input().split(" ")]
print(len([h for h in Hs if K <= h]))

Submission status: Accepted

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

Submission status: Accepted

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

ridable = [x for x in h if x >= K]

print(len(ridable))

Submission status: Accepted

Solution code:

def main():
    import sys
    input = sys.stdin.readline
    N, K = map(int, input().rstrip().split())
    H = [int(x) for x in input().rstrip().split()]
    print(len([x for x in H if x >= K]))

main()

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np


# noinspection PyShadowingBuiltinsInspection

def main():
    n, k = [int(x) for x in input().split()]
    hs = [int(x) for x in input().split()]
    cnt = 0
    for h in hs:
        if h >= k:
            cnt += 1
    print(cnt)
    return


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

for x in [int(x) for x in input().split()]:
    if x >= k:
        c += 1

print(c)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read():
    N, K = map(int, input().strip().split())
    H = map(int, input().strip().split())
    return N, K, H

def solve(N, K, H):
    return sum([1 if h >= K else 0 for h in H])

if __name__ == '__main__':
    inputs = read()
    print("%d" % solve(*inputs))

Submission status: Accepted

Solution code:
num ,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:
str_list = input().split(' ')
int_list = [int(x) for x in str_list]

N, K = int_list[0], int_list[1]

str_list = input().split(' ')
h_list = [int(x) for x in str_list]

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

Submission status: Accepted

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

    ans = 0
    for h in h_l:
        if 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()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """4 150
150 140 100 200"""
        output = """2"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """1 500
499"""
        output = """0"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """5 1
100 200 300 400 500"""
        output = """5"""
        self.assertIO(input, output)
def resolve():
    (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)
if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N,K =inpl()
hlist = inpl()
ans =0
for h in hlist:
    if h >= K :
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
# B
N,K =list(map(int, input().split(" ")))
hs = list(map(int, input().split(" ")))

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in h:
    if i >= k:
        output += 1

print(output)

Submission status: Accepted

Solution code:
N,i=map(int,input().split())
h=list(map(int,input().split()))
j=list(hi >= i for hi in h)
print(j.count(True))

Submission status: Accepted

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

L = [1 for i in range(N) if h[i] >= K]
print (len(L))

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n, k = readmi()
t = readl()
c = 0
for i in t:
    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([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()))
print(sum(map(lambda x:x>=K, H)))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from copy import deepcopy
#import heapq
#import math
#import string

setrecursionlimit(10**6)
input=stdin.readline

n,k=map(int,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 range(n):
    hi = h[i]
    if hi >=k:
        cnt = cnt+1
print(cnt)

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

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

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 = (int(i) for i in input().split())
H = [int(i) for i in 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())
hi = list(map(int,input().split()))

ans = [1 for i in hi if i >=K]

print(sum(ans))

Submission status: Accepted

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

# そのまま入力文字列の入力
# 2つの入力を空白で分割し、数値化
n, k = map(int, input().split())

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

count = 0
h_sorted = sorted(hn)
h_sorted.reverse()

for h in h_sorted:
    if k <= h:
        count = count + 1
    else:
        break

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

cn=0

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

print(cn)

Submission status: Accepted

Solution code:
import numpy as np
n, k = list(map(int, input().split()))
a = np.array(list(map(int, input().split())))
print((a>=k).sum())

Submission status: Accepted

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

cnt=0

for i in a:
    if 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().strip().split())
H = list(map(int, input().strip().split()))

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

def readInts():
  return [int(s) for s in input().split(" ")]

def main():
  N, K = readInts()
  hs = readInts()
  ans = 0
  for h in hs:
    if 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()))
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()))
res = 0
for h in H:
  if h >= K:
    res += 1
print(res)

Submission status: Accepted

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

print(sum(1 for x in hs if k <= x))

Submission status: Accepted

Solution code:
_, k = list(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())
print(len(list(filter(lambda x: x >= k, list(map(int, input().split()))))))

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

Submission status: Accepted

Solution code:
# 2019/09/28

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

output = 0

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

print(output)

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

for h in H:
    if h >= k:
        ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def resolve():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    ok = [1 if hi >= k else 0 for hi in h]
    print(sum(ok))


if __name__ == "__main__":
    resolve()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
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().strip().split()))

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

print(count)

Submission status: Accepted

Solution code:
def main():
    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)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(ans)

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()))
print(sum(1 if t >= K else 0 for t in h))

Submission status: Accepted

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

cnt = 0
for h in H:
    if h >= 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()]
print(sum([item>=k for item in h]))

Submission status: Accepted

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

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

ans = 0
for i in h:
    if i >= k:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
n,h= map(int,input().split())
h_list = input().split()
h_list = [int(one) for one in h_list]
num = 0
for one in h_list:
    if one >= h:
        num += 1
print(num)

Submission status: Accepted

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

ctn = 0
for i in h:
    if i >= k:
        ctn +=1

print(ctn)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n, k = map(int,input().split())
    h_list = list(map(int,input().split()))

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

    print(answer)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(100000)

def ins(): return input().split()
def ii(): return int(input())
def iil(): return list(map(int,ins()))
def lin(): return list(input())
def iin(): return map(int,ins())

n,k = iin()
l = iil()
c = 0
for i in l:
    c = c+1 if i>=k else c
print(c)

Submission status: Accepted

Solution code:
def main():
    N, K, *h = map(int, open(0).read().split())
    print(len(list(filter(lambda x:x>=K, h))))
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())
hlist = list(map(int,input().split()))

counter = 0
for h in hlist:
    if h>=K:
        counter += 1

print(counter)

Submission status: Accepted

Solution code:
import sys
def main():
    input = sys.stdin.readline
    NK = list(map(int, input().split()))
    N = NK[0]
    K = NK[1]
    hs = list(map(int, input().split()))
    ans = 0
    for i in range(N):
        if hs[i] >= K:
            ans += 1
    print(ans)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K, *H = map(int, open(0).read().split())

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

print(cnt)

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
h=list(map(int,input().split()))
cnt=0
h.sort()
for i in range(N):
    if h[i]<K:
        cnt+=1
    else:
        break
print(N-cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
ans =0
for i in range(N):
    if K <= h[i]:
        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:
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:
# -*- coding: utf-8 -*-
n, k = map(int, input().split())
hs = list(map(int, input().split()))

c = 0
for hi in hs:
    c += 1 if hi >= k else 0

print(c)

Submission status: Accepted

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

ans = 0
for h in a:
    ans += h >= k

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(len(h)):
    if h[i] >= k:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np

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

input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    N, K = map(int, input().split())
    A = list(map(int, input().split()))

    cnt = 0
    for h in A:
        if h >= K:
            cnt += 1

    return cnt

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

Submission status: Accepted

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

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


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

ans = 0
for i in height:
    if 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([hi for hi in h if hi >= K]))

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : map(int, stdin.readline().split())

def main():
  n, k = na()
  h = list(na())
  cnt = 0
  for hh in h:  
    if hh >= k:
      cnt += 1
  print(cnt)

main()

Submission status: Accepted

Solution code:
input = raw_input


N,K = list(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:
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces
gi = lambda : list(map(int,input().split()))
n, m = gi()
l = gi()
print(sum([1 if e >= m else 0 for e in l]))

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
from functools import reduce
import math

input = sys.stdin.readline


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

if __name__ == '__main__':
    main()