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

Submission status: Accepted

Solution code:
def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]

# n = int(input())
# a, b
# s = input()


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

ans = 0
for e in h:
    if e >= K:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

# 必ず勝率が上がる勝ち方がある
def main():
    """ main """
    N,K = map(int, input().split())
    HS = list(map(int, input().split()))
    ans = 0
    for h in HS:
        if h >= K: ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n, k = [int(item) for item in input().split()]
h = [int(item) for item in input().split()]
ans = 0
for item in h:
    if item >= 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 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()))
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(i) for i in input().split()]
c = 0
for i in h:
	if i >= k:
		c+=1
print(c)

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

n, k = na()
h = na()
print(len([_ for _ in h if _ >= k]))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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()))
a=0
for i in h:
    if i>=K:
        a+=1
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
import itertools
INF = 10**9
MOD = 10**9+7

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

Submission status: Accepted

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

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

count=0

for hl in hlist:
    if hl>=k:
        count+=1

print(count)

Submission status: Accepted

Solution code:
def solve():
  N, K = map(int, input().split())
  H = [int(i) for i in input().split()]
  return len(list(filter(lambda h: h >= K, H)))

print(solve())

Submission status: Accepted

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

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

print(t)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc142/tasks/abc142_b

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

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

Submission status: Accepted

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

cnt = 0
for e in h:
    if e >= k:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
from bisect import bisect_left
n, k = map(int, input().split())
l = sorted(map(int, input().split()))
print(n - bisect_left(l, k))

Submission status: Accepted

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

r = 0
for hi in list_h:
    if (hi >= k):
        r += 1

print(r)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#B問題
N,K = map(int,input().split())
H = list(map(int,input().split()))
H.sort(reverse=True)
ans = 0
for h in H:
    if h >= K:
        ans+=1
    else:
        break
        
print(ans)

Submission status: Accepted

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

print(len(h))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

ans = 0

for i in h:

    if i >= K:
        ans += 1

print (ans)

Submission status: Accepted

Solution code:
import sys
n, k = [int(i) for i in sys.stdin.readline().split()]
h_ls = [int(i) for i in sys.stdin.readline().split()]
print(len([h for h in h_ls if h >= 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:
def main():
    out=0
    N,K=map(int,input().split())
    H=map(int,input().split())
    for h in H:
        if h>=K:
            out+=1

    return out
    

print(main())

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

total = 0
for h in heights:
    if h >= K: total+=1

print(total)

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

n, k = na()
h = na()
ct = 0
for hi in h:
    if hi >= k:
        ct += 1
print(ct)

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

cnt=0
for a in A:
	if a>=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 for i in h if i>=k]))

Submission status: Accepted

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


def main():
    n, k = (int(z) for z in input().split())
    hs = [int(h) for h in input().split()]
    res = sum(h >= k for h in hs)
    print(res)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
import heapq
from bisect import bisect_right, bisect_left
from collections import defaultdict, Counter
import itertools
import sys
sys.setrecursionlimit(10**7)
MOD = 10**9 + 7
INF = float("inf")


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools


import queue
from collections import deque



def main():
    num, k = map(int, input().split())
    data = list(map(int, input().split()))
    ans = 0

    for i in range(num):
        if data[i] >= k:
            ans += 1

    print(ans)






if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys


def main():
    n, k = [int(s) for s in sys.stdin.readline().strip().split()]
    h = [int(s) for s in sys.stdin.readline().strip().split()]

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



main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(N, K, H):
    return len(list(filter(lambda x: x >= K, H)))


def main():
    N, K = read_int_n()
    H = read_int_n()
    print(slv(N, K, H))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
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 = map(int,input().split())
*H, = map(int,input().split())
print(sum(h>=K for h in H))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

# Setup
import sys
import collections
sys.setrecursionlimit(4100000)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

c = 0
for a in A:
    if a >= K:
        c += 1
print(c)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC141b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    n,k=map(int,input().split())
    H=list(map(int,input().split()))
    ans=0
    for h in H:
        ans+=(h>=k)
    print(ans)
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())


n, k = li()
h = list(li())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
mod = 1000000007
MOD = 998244353
ii = lambda :  int(input())
si = lambda :  input()
dgl = lambda : list(map(int, input()))
f = lambda :   map(int, input().split())
il = lambda :  list(map(int, input().split()))
it = lambda :  tuple(map(int, input().split()))
ls = lambda :  list(input())
n,k=f()
l=il()
print(sum(i>=k for i in l))

Submission status: Accepted

Solution code:

import sys
input = sys.stdin.readline
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# A = [ int(input()) for _ in range(N) ]
##############################

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

print sum(x>=K for x in h)

Submission status: Accepted

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

print(len([x for x in h_arr if x >= K]))

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
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 = [ int(v) for v in input().split() ]
h_list = [ int(v) for v in input().split() ]
h_list = [ i >= k for i in h_list ]
print(h_list.count(True))

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  n,k=LI()
  ans=0
  l=LI()

  for x in l:
    if x>=k:
      ans+=1
  return ans

# main()
print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N,K = IL()
h = IL()

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

print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque
from heapq import *
sys.setrecursionlimit(200000)
input = sys.stdin.readline

H, K, = map(int, input().split())
# N = int(input())
L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
# S = input().strip()

ans = 0
for v in L:
    if v >= K:
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())			# "5 7" -> ["5", "7"] -> 5, 7 => N=5,K=7
H =        list( map(int, input().split()) )	# 1 2 3 4 5 ...

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

print(ans)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

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

# output
print(ans)

Submission status: Accepted

Solution code:
import sys
from heapq import heappop, heappush
from operator import itemgetter
from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 10**9 + 7
INF = float('inf')

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


sol()

Submission status: Accepted

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

print(len(list(filter(lambda h: h >= K, H))))

Submission status: Accepted

Solution code:
import sys


input = sys.stdin.readline


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

    ans = 0
    for n in h:
        if n >= K:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    
    ans = 0
    for x in arr:
        if x >= k:
            ans += 1
    
    print(ans)
    
    return 0

main()

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:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N,K = MI()
    H = LI()
    ans = 0
    for h in H:
        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 K <= H[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



N, K = list(map(int, sys.stdin.readline().split()))
H = list(map(int, sys.stdin.readline().split()))

H = np.array(H, dtype=int)
a = np.count_nonzero(H >=K)
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
def slove():
    import sys
    input = sys.stdin.readline
    n, k = list(map(int, input().rstrip('\n').split()))
    h = list(map(int, input().rstrip('\n').split()))
    cnt = 0
    for i in range(n):
        cnt += 1 if h[i] >= k else 0
    print(cnt)


if __name__ == '__main__':
    slove()

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:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)


def solve(N: int, K: int, h: "List[int]"):
    ret = 0
    for i in range(N):
        if h[i] >= K:
            ret += 1
    print(ret)
    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:
N, K = map(int, input().split())
h = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys

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

def main():
    n,k=map(int, input().split())
    h=list(map(int, input().split()))
    cnt=0
    for hk in h:
        if hk>=k:cnt+=1
    print(cnt)

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)