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:
#!/usr/bin/env python3
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:
def main():
    n,k=map(int,input().split())
    ans=n
    for i in list(map(int,input().split())):
        if i<k:
            ans-=1
    print(ans)
    
main()

Submission status: Accepted

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

    # for i in range(N):
    #     A = list(map(int, input().split()))


if __name__ == '__main__':
    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 one in h:
  if one >= k:
    ans += 1
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ami = [int(i) for i in input().split()]
a = 0
for i in ami:
    if i >= k:
        a += 1
        
print(a)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import sys
# input = sys.stdin.readline
sys.setrecursionlimit(100000)
MOD = 10 ** 9 + 7

#N = int(input())
#A = [int(x) for x in input().split()]
#V = [[0] * 100 for _ in range(100)]

N,K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
#ABC142B
import sys
#sys.setrecursionlimit(100000)

#n=int(input())
tmp = input().split()
n,k = list(map(lambda a: int(a), tmp))
tmp = input().split()
h = list(map(lambda a: int(a), tmp))

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)

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

answer = sum(x>=K for x in H)
print(answer)

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

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

h.sort()

j = bisect.bisect_left(h,k)
print(n-j)

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

Submission status: Accepted

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

Submission status: Accepted

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

print(len([1 for i in map(int, input().split()) if i >= k]))

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

Submission status: Accepted

Solution code:
n,k=list(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:
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): #startline-------------------------------------------
    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() #endline===============================================

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import sys
n,k=map(int,input().split())
a=sorted(map(int,input().split()))
for i in range(n):
    if k<=a[i]:
        print(n-i)
        sys.exit()
print(0)

Submission status: Accepted

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
    #n=int(input())
    n,k= map(int, sys.stdin.readline().split(' '))
    a=list(map(int,sys.stdin.readline().split(' ')))
    ans=0
    for b in a:
        if(b>=k):
            ans+=1
    print(ans)
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Accepted

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

Submission status: Accepted

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

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

sum = 0

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

print(sum)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K = [int(x) for x in input().split()]
import numpy as np
h = np.array([int(x) for x in input().split()])
print(h[h>=K].shape[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(N-bisect.bisect_left(h, K))

Submission status: Accepted

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

Submission status: Accepted

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

def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    n, k = rli()
    lh = rli()
    print(sum(1 for h in lh if h >= k))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for x in h:
    if x >= k:
        res += 1

print(res)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

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

count = 0
for hh in H:
    if hh >= 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 n in H:
    if n >= K:
        ans += 1

print(ans)

Submission status: Accepted

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

H = list(map(int, input().split()))
ctr = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

cannot = bisect.bisect_left(H, K)
print(N-cannot)

Submission status: Accepted

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

print([x>=k for x in h].count(True))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def getlist():
	return list(map(int, input().split()))

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

print(ans)

Submission status: Accepted

Solution code:

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


cnt = 0

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return list(map(int, sys.stdin.readline().split()))
def II(): return int(sys.stdin.readline())
def LS(): return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]

def main():
    n, k = LI()
    hs = LI()
    ans = 0
    for h in hs:
        if h >= k:
            ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def InputToInt():
    A = input().split()
    for i in range(len(A)):
        A[i] = int(A[i])
    return A
    
if __name__ == '__main__':
    N, K = InputToInt()
    h = InputToInt()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]

l2 = [i for i in l if i >= b]
print(len(l2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,K,*H=map(int,open(0).read().split());print(sum(h>=K for h in H))

Submission status: Accepted

Solution code:
import numpy as np

n, k = [int(v) for v in input().split()]
hs = np.array([int(v) for v in input().split()])
print((hs >= k).sum())

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

a = 0
for h in H:
    a += h >= K
print(a)

Submission status: Accepted

Solution code:
n, k = map(int, input().split())
ans = 0
for i in map(int, input().split()): ans+=(i>=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())
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())
h=[int(i) for i in input().split()]
print(sum([i>=k for i 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:
def calc(N, K, A):
    return len([a for a in A if a >= K])


(N, K) = tuple([int(s) for s in input().split()])
A = [int(s) for s in input().split()]
print(calc(N, K, A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

out = sum([1 for h in hs if h >= k])
print(out)

Submission status: Accepted

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

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:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

n,k = get_nums_l()
hhh = get_nums_l()

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

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:
import sys
input = sys.stdin.readline
N,K = map(int,input().split())
ans = 0
for h in map(int,input().split()):
  if h >= K: ans += 1
print(ans)

Submission status: Accepted

Solution code:

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

ret = sum([1 if hi>=k else 0 for hi in h])


print(ret)

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(res)

Submission status: Accepted

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

cnt = 0

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def solve(N: int, K: int, h: "List[int]"):
    counter = 0
    for hh in h:
        if hh >= K:
            counter += 1
    print(counter)

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

Submission status: Accepted

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

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

print(num)

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os

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:
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n, k = nm()

h = nl()

cnt = 0

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

    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
    return ans

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

res = 0
for i in range(n):
    if L[i] >= K:
        res += 1

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

ans = sum([1 for h in H 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 i in h:
    if i >=k:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
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 tall in h:
	if tall >= 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 a in h:
    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)