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 = list(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=input().split()
c=0

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(S)

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:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 12 00:55:57 2020

@author: Kanaru Sato
"""

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

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

Submission status: Accepted

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque
# from collections import Counter

import numpy as np
# import scipy as scp

# 入力の受け取り
n,k = map(int,input().split())
# 配列入力の受け取り
arrh = np.array(input().split(),dtype=np.int64)

filter = arrh >= k
ans = len(arrh[filter])

print(ans)

Submission status: Accepted

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

def func(n, k, lst):
  res = 0
  for i in range(n):
    if lst[i] >= k:
      res += 1
  return res

print(func(N, K ,List))

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:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

N, K = map(int, input().split())
h = list(map(int, input().split()))
print(sum(1 if h[i] >= K else 0 for i in range(N)))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num, least = map(int,input().split())
high = [int(x) for x in input().split()]

high.sort(reverse = True)

count = 0
i = 0

while i < num:
    if high[i] >= least:
        count += 1
        i += 1
    else:
        break

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,height = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in A:
  if i>=height:
    ans +=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
f=lambda:map(int,input().split())
_,k=f()
print(sum(i>=k for i in f()))

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:
number = input().split(" ")
N = int(number[0])
K = int(number[1])
human  = input().split(" ")
ans = 0
for i in human:
    if int(i) >= K:
        ans += 1
    else:
        pass
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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,b=map(int,input().split())
l=list(map(int,input().split()))
cnt=0
for i in l:
  if i>=b:cnt+=1
print(cnt)

Submission status: Accepted

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

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

    # print((np.array(h) >= K).sum())
    p = 0
    for x in h:
        if x >= K: p+=1
    print(p)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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()))

cnt = 0

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

Submission status: Accepted

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

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:
N,K = map(int,input().split(" "))
List = [int(i) for i in input().split(" ") if int(i)>=K]
print(len(List))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

human = []
for i in h:
    if i >= k:
        human.append(i)

print(len(human))

Submission status: Accepted

Solution code:
from sys import stdin

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

hh = [i for i in h if i >= k]

print(len(hh))

Submission status: Accepted

Solution code:
import math
import sys
import numpy as np

def input():
    return sys.stdin.readline()[:-1]

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

print(np.sum(h >= K))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from bisect import bisect_left
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(len(h[bisect_left(h, k):]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

def main():
    n, k = list(map(int,ipti().split()))
    h = list(map(int,ipti().split()))
    ans = 0

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

Submission status: Accepted

Solution code:
N,K = map(int,input().split())
h = list(map(int,input().split()))
ans = 0
for x in h:
    if x >= 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=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 = map(int, input().split())
lis_h = list(h)
cnt = 0
for h in lis_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=sum(map(lambda x: x>=k, h))
print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
num = list(map(int,input().split()))
num_list = list(map(int,input().split()))

count = 0

for i in range(0,num[0]):
  if num_list[i] >= num[1]:
    count = count + 1
    
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = map(int, input().split())
H = [int(h) for h 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())
hights = list(map(int,input().split()))
result = 0    
for hight in hights:
    if hight >= k:
        result += 1
        
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    n, k = map(int, input().split())
    h = list(map(int, input().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 = sum(h >= K for h in H)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(c)

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
h=list(map(int,input().split()))
h.sort(reverse=True)
ans=0
for i in range(n):
    if h[i]>=k:
        ans+=1
    else:
        break
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()]

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

print(len([i for i in a if i>k-1]))

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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, height = map(int, input().split())
hl = list(map(int, input().split()))
cnt = 0
for i in hl:
    if height <= i:
        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 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()))
s = 0
for i in range(0,N):
    if h[i] >= K:
        s = s+1
print (s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
h = tuple(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 i in range(n):
    if h[i] >= k:
        ans += 1
        continue
    else:
        continue

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding:utf-8 -*-

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import sys
n, k, *h = map(int, sys.stdin.buffer.read().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())
arrh = list(map(int,input().split()))
arrh.sort(reverse=True)
for i in range(n):
    if arrh[i] < k:
        print(i)
        break
    if i == n-1:
        print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#python3

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

main()

Submission status: Accepted

Solution code:
N, K = [int(i) for i in 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:
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()))

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

Submission status: Accepted

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

result = list(filter(lambda i: i >= k, h))

print(len(result))

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range (N):
    if h[i] < K :
        print(i)
        break
else:
    print(N)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc142/tasks/abc142_b

n, k = [int(x) for x in input().split()]
print(len([int(x) for x in input().split() if int(x) >= k]))

Submission status: Accepted

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

Submission status: Accepted

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

r = 0
for hh in filter(lambda x: x >= K, h):
    r += 1

print(r)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(num)

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N,K=map(int,input().split())
high_list=list(map(int,input().split()))
new_list=sorted(high_list,reverse=True)
for i,j in enumerate(new_list):
    if j<K:
        ans=i
        break
else:
    ans=N
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0
for h in H:
    if K <= h:
        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 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:
p = list(map(int, input().split()))
h = list(map(int, input().split()))
n = p[0]
k = p[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

for i in range(len(x)):
    if x[i]<B:
        A=A-1


print(A)

Submission status: Accepted

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

n = 0
for h in H:
  if h >= K:
    n += 1
  else:
    break

print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) ## 横一列
A = [int(input()) for _ in range(N)] ## 縦一列
lst = [list(map(int,input().split())) for i in range(M)] ## 二次元
"""

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N,K = MI()
	hh = LI()
	ans = 0
	for h in hh:
		if h >= K:
			ans+=1
	print(ans)

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())

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

count = 0

for i in t:
    if y <= i:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

print(ans)

Submission status: Accepted

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

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 K <= H[i]:
        a = a+1
        
print(a)

Submission status: Accepted

Solution code:
n,k = map(int,input().split())
high = [int(i) for i in input().split()]
ans = []

for i in high:
    if k <= i:
        ans.append(i)
print(len(ans))

Submission status: Accepted

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

N, K = MAP()
H = LIST()

total = 0
for i in H:
	if i >= K:
		total += 1

print(total)

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 bisect

n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(n - bisect.bisect_left(h, k))

Submission status: Accepted

Solution code:
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:
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())
print(sum(map(lambda x:x>=K, map(int, input().split()))))