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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum([hh >= K for hh in h]))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

count = 0
for a in AS:
  if a >= 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:
def main(N,K,h):
    h.sort()
    count = 0
    for i in range(len(h)):
        if h[i] < K:
            count += 1
        else:
            break
    return N - count

N,K = map(int,input().split())
h = list(map(int, input().split()))
print(main(N,K,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:
from bisect import bisect_left

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

hight_list.sort()
count = bisect_left(hight_list, k)
print(n - count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
N,K=map(int,input().split())
L=list(map(int,input().split()))
print(sum(1 for i in L if i>=K))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ppl)

Submission status: Accepted

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

count=0

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

print(count)

Submission status: Accepted

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

cnt = 0
for num in nums:
    if num >= k:
        cnt +=1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(inp):
    (N, K) = map(int, inp.readline().strip().split(' '))
    H = list(map(int, inp.readline().strip().split(' ')))

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

    return str(r)


def test(s):
    from io import StringIO
    print(solve(StringIO(s)))


def main():
    import sys
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    # test('50\n' + '100 ' * 50)
    main()

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
H = [int(_) for _ 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())
H = list(map(int, input().split()))
cnt = int()
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=[i for i in h if i>=K]
print(len(ans))

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
height = [int(i) for i in input().split()]
cnt = 0
for height_i in height:
    if k <= height_i:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
from bisect import bisect_left

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

h.sort()
cnt = bisect_left(h, k)
print(n-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:
# 142
n,k = map(int, input().split())
d = list(map(int, input().split()))

res = 0
for i in d:
    if i >= k:
        res += 1
print(res)

Submission status: Accepted

Solution code:
_, K = list(map(int, input().split()))
print(len(tuple(filter(lambda x: x >= K, map(int, input().split())))))

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N, K = MAP()
H = LIST()
c = 0
for i in range(N):
    if K <= H[i]:
        c += 1

print(c)

Submission status: Accepted

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

possible = [h[x] for x in range(n) if h[x] >= k]
print(len(possible))

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

N = ip[0]
K = ip[1]

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

print(ans)

Submission status: Accepted

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

for i in range(len_height_list):
    if height_list[i] >= K:
        count += 1
        
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
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(len(h)):
  if h[i] >= K:
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

for i in range(n):
  if sList[i] >= k:
    print(len(sList[i:]))
    exit(0)
print(0)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for i in hi:
    if k <= i:
        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 h:
    if i >= k:
        count += 1

print(count)

Submission status: Accepted

Solution code:
a=input()
b=input()
aa=a.split(' ')
N,K=int(aa[0]),int(aa[1])
hn = [int(b0) for b0 in b.split(' ')]

c=0
for hi in hn:
    if hi >= K:
        c += 1

print(c)

Submission status: Accepted

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

total = sum(x >= K for x in heights)
print(total)

Submission status: Accepted

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

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

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def LI():
  return [int(s) for s in input().split()]

N,K = LI()

h_s = LI()
h_s.sort(reverse = True)

count = 0

for h in h_s:
  if h  < K:
    break
  count+=1
  
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(list(map(lambda x: k <= x, h))))

Submission status: Accepted

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

Submission status: Accepted

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

print(len(list(filter(lambda h: h>=k, l))))

Submission status: Accepted

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

Submission status: Accepted

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

print(sum(1 for i in l if i>=k))

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
nk = input()
nk_list = nk.split(" ")
n = int(nk_list[0])
k = int(nk_list[1])
h = input()
h_list = h.split(" ")

number = 0
for i in range(n):
    if int(h_list[i]) - k >= 0:
        number += 1
print(number)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

inputA =  list(map(int,input().split()))
inputB =  list(map(int,input().split()))

humancount = inputA[0]
talllimit = inputA[1]
anser = 0

for count in range(0,humancount):
    if inputB[count] >= talllimit:
        anser += 1


print(anser)

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))

sys.setrecursionlimit(10 ** 9)


def main():
    N, K = MAP()
    H = LIST()

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

    print(cnt)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

prm = [ False ] * n
for i in range( n ):
  prm[ i ] =  d[ i ] >= k
print( sum( prm ))

Submission status: Accepted

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

Submission status: Accepted

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

L=sorted(L,reverse=True)
ans=N
for i in range(N):
    if L[i]<K:
        ans=i
        break
print(ans)

Submission status: Accepted

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

for i in li:
  if i >= b:
    num += 1
print(num)

Submission status: Accepted

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

r = 0

for h in hs:
  r += 0 if h < k else 1

print(r)

Submission status: Accepted

Solution code:
def main():
    n, k = map(int, input().split())
    num_list = list(map(int, input().split()))

    count = 0

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

    print(count)

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

print(len(list(filter(lambda x: x >= K, hs))))

Submission status: Accepted

Solution code:
import itertools

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)
    return 0
if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = len([x for x in h if x >= K])

print(ans)

Submission status: Accepted

Solution code:
import numpy as np
 
N,K = [int(s) for s in input().split()]
heights = np.array([int(s) for s in input().split()])
 
print(sum(heights >= K))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N, K, *H = map(int, read().split())
print(sum(x >= K for x in H))

Submission status: Accepted

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

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:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

# N = int(readline())
# D = [int(d) for d in readline().split()]

import numpy as np

N, K = map(int, readline().split())
h = [int(x) for x in readline().split()]

print(len([x for x in h if x-K >= 0]))

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

# N = int(readline())
# D = [int(d) for d in readline().split()]

import numpy as np

N, K = map(int, readline().split())
h = [int(x) - K for x in readline().split()]

# ha = np.array(h)

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

# N = int(readline())
# D = [int(d) for d in readline().split()]

import numpy as np

N, K = map(int, readline().split())
h = [int(x) - K for x in readline().split()]
ha = np.array(h)

print(np.count_nonzero(ha >= 0))

Submission status: Accepted

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

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

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

hs = [int(h) for h in sys.stdin.readline().split(" ")]

oks = [h for h in hs if h >= k]

print(len(oks))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    res = filter(lambda i:True if i >= k else False, h)

    print(sum(1 for _ in res))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

num = 0

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

print(num)

Submission status: Accepted

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

import numpy as np
li = np.array(list(map(int, input().split())))

print(len(li[li>=B]))

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
if h[0] < K:
    print(0)
    exit()
start = 0
end = N
while start < end-1:
    mid = (end+start)//2
    if h[mid] >= K:
        start = mid
    else:
        end = mid
print(start+1)

Submission status: Accepted

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

for i in range(N):
    if d[i]>= K:
        c += 1
print(c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n, k = input().split()
n = int(n)  # 人数
k = int(k)  # 制限身長
h = input().split()

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

Submission status: Accepted

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

for i in range(a):
    if l[i] >= b:
        x +=1

print(x)

Submission status: Accepted

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

for i in a:
  if i >= h:
    ans += 1

print(str(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
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 list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
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 I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n,k = LI()
    a = LI()

    return len([c for c in a if c >= k])


print(main())

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:
# coding: utf-8


def main():

    n, limit = map(int, input().split(' '))
    heights = list(map(int, input().split(' ')))
    heights = sorted(heights, reverse=True)

    nakama_count = 0
    for height in heights:
        if height >= limit:
            nakama_count += 1
        else:
            break

    print(nakama_count)

    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
import numpy as np


def main():

    _, limit = map(int, input().split(' '))
    heights = np.array(list(map(int, input().split(' '))))

    print(np.count_nonzero(heights >= limit))

    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    n, k = map(int, input().split(' '))
    heights = list(map(int, input().split(' ')))
    
    print(len([i for i in heights if i >= k]))
    
    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8


def main():

    n, limit = map(int, input().split(' '))
    heights = list(map(int, input().split(' ')))

    nakama_count = 0
    for height in heights:
        if height >= limit:
            nakama_count += 1

    print(nakama_count)

    return 0
    
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Jan  2 16:11:53 2020

@author: student2
"""
n, k = map(int,input().split())

prijatelji = map(int, input().split())

x=0

for i in prijatelji:
    if i >= k:
        x = x+1
print (x)

Submission status: Accepted

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

Submission status: Accepted

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

array = []
for i in range(n):
    if h_lst[i] >= k:
        array.append(h_lst[i])
print(len(array))

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
li = list(map(int,input().split()))
li_sort = sorted(li)
ans = 0
for a in li_sort:
    if a >= 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:
# Roller Coaster

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

# solve
res = sum([hi >= K for hi in h])

# output
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)