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: Wrong Answer

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

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

# n = int(input())
# s = [map(int, input()) for i in range(3)]

index = 0
h.sort()

for i in range (0,n):
    if h[i] >= k:
        index = i
        break

print(n-index)

Submission status: Wrong Answer

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

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

# n = int(input())
# s = [map(int, input()) for i in range(3)]

index = 0
h.sort()
print(h)
for i in range (0,n):
    if h[i] >= k:
        index = i
        break

print(n-index)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
count = 0
for count in range(0, n):
    if list_h[-1] < k: break
    elif list_h[count] >= k: break
print(len(list_h[count:]))

Submission status: Wrong Answer

Solution code:
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
count = 0
for count in range(0, n):
    if list_h[count] >= k: break
print(len(list_h[count:]))

Submission status: Wrong Answer

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

def nibu(x, arr):
  if x <= arr[0]:
    return len(arr)
  if arr[-1] < x:
    return 0
  l = 0
  h = len(arr) - 1
  while h - l >1:
    m = (l + h) // 2
    if x < arr[m]:
      h = m
    else:
      l = m
  return len(arr) - h
print(nibu(K, h))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# ABC142
# Roller Coaster
n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
ct = 0
for i in range(n):
    print(i)
    if H[i] < k:
        ct += 1
print(ct)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
H = sorted(list(map(int, input().split())))
ct = 0
for i in H:
    if i < k:
        ct += 1
print(ct)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(sum([1 if h > K else 0 for h in H]))

Submission status: Wrong Answer

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: Wrong Answer

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
  else:
    continue
  print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if ( 1 <= N <= 10**5 and 1 <= K <= 500 ): sys.exit()

count = 0
for I in array_hight:
    if not ( 1 <= I <= 500): sys.exit()
    if I >= K:
        count += 1
print(count)

Submission status: Wrong Answer

Solution code:
N,K=input().split()
print(sum([1 for i in input().split() if K<=i]))

Submission status: Wrong Answer

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

for height in heights:
    if height < K:
        unqualified += 1

print(unqualified)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input().split()
H = input().split()
b = 0
for h in H:
	if(a[1] <= h):
		b +=1   
print(b)

Submission status: Wrong Answer

Solution code:
N,K=map(int, input().split())
List=list(map(int,input().split())) 
print(sum(1 for x in List if x>K))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = map(int,input().split())
H = sorted(list(map(int, input().split())), reverse=True)
cnt = 0
for i in range(n):
    print(H[i])
    if H[i] >= k:
        cnt += 1
    elif H[i] < k:
        break
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
lis=list(map(int,input().split()))
lis.sort()
ans=0
for i in lis:
    if i<k:
        ans+=1
    else:
        print(n-ans)
        break

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
lis=list(map(int,input().split()))
lis.sort()
ans=0
for i in range(n):
    if i<k:
        ans+=1
    else:
        print(n-ans)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

h = [int(x) for x in input().split()]
cnt=0
for i in range(n):
    if h[i] < k:
        cnt+=1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

ans = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
odds = [s[i] for i in range(len(s)) if i % 2 == 0]
evens = [s[i] for i in range(len(s)) if  i % 2 == 1]
if odds.count('L') > 0:
  print('No')
elif evens.count('R') > 0:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
n,k=map(int,input().split())
listh=list(map(int,input().split()))
count=0
listh.sort()
for h in listh:
  if h>=k:
    count+=listh.index(h)
    break
print(n-count)

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(n,r))

def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)



n,k=input2()
h=input_array()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
lst = list(map(int, input().split()))
i = 0
for h_i in lst:
    if h_i < K:
        continue
print(i)

Submission status: Wrong Answer

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

isGraterThanN = lambda n: lambda value: value >= n
isGraterThanK = isGraterThanN(K)

h_grater_then_k = filter(isGraterThanK, h)
h_grater_then_k = list(h_grater_then_k)

answer = len(h_grater_then_k)
print(answer)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
h = list(map(int,input().split()))
ans = 4
for i in h:
  if i < K:
    ans -= 1    
print(ans)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k= map(int,raw_input().split())
l = map(int,raw_input().split())
r= 0
for i in l:
    if i < k:
        r += 1
print r

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

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

if 1 == len(l):
    if l[0] >= k:
        print(1)
    else:
        print(0)
    exit()
elif l[0] >= k:
    print(n)
    exit()
elif l[n-1] < k:
    print(0)
    exit()
        
min_suffix = 0
max_suffix = n-1

i = (min_suffix + max_suffix) // 2
while True:
    if max_suffix - min_suffix > 1:
        if l[i] < k:
            min_suffix = i
        elif l[i] > k:
            max_suffix = i
        else:
            print(n-i)
            exit()
        i = (min_suffix + max_suffix) // 2
    else:
        print(n-min_suffix)
        exit()

Submission status: Wrong Answer

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

if 1 == len(l):
    if l[0] >= k:
        print(1)
    else:
        print(0)
    exit()
elif l[0] >= k:
    print(n)
    exit()
elif l[n-1] < k:
    print(0)
    exit()
        
min_suffix = 0
max_suffix = n-1

i = (min_suffix + max_suffix) // 2
while True:
    if l[i] < k:
        min_suffix = i
    elif l[i] > k:
        max_suffix = i
    else:
        print(n-i)
        exit()
    i = (min_suffix + max_suffix) // 2

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num, least = map(int,input("num: ").split())
high = [int(x) for x in input("high: ").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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=input()
odd=S[0::2]
even=S[1::2]
if 'L' in odd or 'R' in even:
    print('No')

else:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

f = 0

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

print(f)

Submission status: Wrong Answer

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

print(hs)

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

print(len(oks))

Submission status: Wrong Answer

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(heights >= limit)
    print(np.count_nonzero(heights >= limit))

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

Submission status: Wrong Answer

Solution code:
N_K = str(input())
H = str(input()).split(" ")

N = N_K.split(" ")[0]
K = N_K.split(" ")[1]

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

print(count)

Submission status: Wrong Answer

Solution code:
s = input()
count = 0
first_half, second_half = s[:len(s)//2], s[(len(s)+1)//2:]
if first_half == reversed(second_half):
    print(count)
else:
    for x in range(len(first_half)):
        if first_half[x] != second_half[len(second_half)-x-1]:
            count += 1
    print(count)

Submission status: Wrong Answer

Solution code:
try:
	num_people = int(input())
	height_min = int(input(  ))
	i = 1
	height = list()
	allowed_person = 0

	while i <= num_people < 100000:
		height = int(input(  ))
		if height_min <= height <= 500:
			allowed_person += 1
		i += 1
	print(allowed_person)

except Exception as e:
	print(e)

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
h=list(map(int,input().split()))
h=sorted(h)
left=-1
right=len(h)
while right-left>1:
  mid=(right+left)//2
  if h[mid]>=K:
    right=mid
  else:
    left=mid
print(len(h)-left)

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
h=list(map(int,input().split()))
h=sorted(h)
left=-1
right=len(h)
while left-right>1:
  mid=(right+left)//2
  if h[mid]>=K:
    right=mid
  else:
    left=mid
print(len(h)-left)

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
h=list(map(int,input().split()))
h=sorted(h)
right=-1
left=len(h)
while left-right>1:
  mid=(right+left)//2
  if h[mid]>K:
    left=mid
  else:
    right=mid
print(len(h)-left)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K = map(int, input().split())
h = list(map(int, input().split()))
h.sort(reverse=True)
a=0
for i in h:
  if i>=K:
    a+=1
  else:
    break

Submission status: Wrong Answer

Solution code:
n,k=[int(x) for x in input().split()]
h = [int(y) for y in input().split()]
leng=len(h)
counter=0
print(leng)
for i in range(1,leng+1):

    if h[i-1]>=k:
        counter+=1
print(counter)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
for index, x in enumerate(h):
  if x == k:
    print(n - index + 1)
    break

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(150, [150, 140, 100, 200]), 2)

    def test_2(self):
        self.assertEqual(think(500, [499]), 0)

    def test_3(self):
        self.assertEqual(think(1, [100, 200, 300, 400, 500]), 5)


def solve():
    k, h = read()
    result = think(k, h)
    write(result)


def read():
    n, k = read_int(2)
    h = read_int(n)
    return k, h


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


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


def write(result):
    print(result)


if __name__ == '__main__':
    # import sys
    # sys.setrecursionlimit(10000)
    # unittest.main()
    solve()

Submission status: Wrong Answer

Solution code:
k = int(input().split(' ')[1])
a = input().split(' ')
a.sort()
for i in range(len(a)):
    if int(a[i]) >= k:
        print(len(a) - i)
        exit(0)

print(0)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0

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

print(ans)

Submission status: Wrong Answer

Solution code:
str = input()
Zlst=str.split()
N=int(Zlst[0])
K=int(Zlst[1])
a=input()
al=a.split()
A=[]
for i in range(N):
   A.append(int(al[i]))
A.sort()
A.reverse()
for j in range(N):
    if(A[j]<K):
        break
print(j)

Submission status: Wrong Answer

Solution code:
import bisect
n, k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
print(n - bisect.bisect_right(h, k))

Submission status: Wrong Answer

Solution code:
N,K=map(int,input().split())
h=list(map(int, input().split()))
h.sort(reverse=True)
Ans=N-1
for i in range(N):
    if h[i]<K :
        Ans=i
        break

print(Ans)

Submission status: Wrong Answer

Solution code:
import bisect

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

h.sort()
ans = N - bisect.bisect_left(h,K) +1
print(ans)

Submission status: Wrong Answer

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

H = sorted(H)
def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while(end >= start):
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid+1
        elif x < arr[mid]:
            end = mid -1
        else:
            for i in range(mid-start):
                if arr[mid-i-1] < x:
                    start = mid - i
                    break
            break
    return start
print(K - binary_search(H, K))

Submission status: Wrong Answer

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

def binary_search(arr, x):
    start = 0
    end = len(arr)-1
    while(end >= start):
        mid = int(start + (end-start)/2)
        if x > arr[mid]:
            start = mid+1
        elif x < arr[mid]:
            end = mid -1
        else:
            for i in range(mid-start):
                if arr[mid-i-1] < x:
                    start = mid - i
                    break
            break
    return start
print(binary_search(H, K))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

h.sort()
a = 0

for i in range(N):
  if h[i] >= K:
    a += i
    break
print(N-a)

Submission status: Wrong Answer

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

h.sort()
a = 0

for i in range(N):
  if h[i] >= K:
    a += i
  break
print(N-a+1)

Submission status: Wrong Answer

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

h.sort()
a = 0

for i in range(N):
  if h[i] >= K:
    a += i
    break
print(N-a+1)

Submission status: Wrong Answer

Solution code:
x = input().split()
y = input().split()

cnt = 0

for i in y:
  if i >= x[1]:
    cnt += 1
    
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

import bisect

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

H.sort()

idx = bisect.bisect_right(H, K)

print(N-idx)

Submission status: Wrong Answer

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:
        break
print(i)

Submission status: Wrong Answer

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:
        break
print(i)

Submission status: Wrong Answer

Solution code:
in1 = input()
in2 = input()

#b, c = map(int, input().split())
#s = input()
#print("{} {}".format(a+b+c, s))

N,K = in1.split()

h_list = in2.split()

#print(N,K)


num=0
for h in h_list:
        if h >= K:
                num+=1

print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import fileinput
for i, line in enumerate(fileinput.input()):
  if i == 0:
    N, K = map(int, line.strip().split())
  else:
    hs = map(int, line.strip().split())
    print(sum([1 for h in hs if h > K]))
    break

Submission status: Wrong Answer

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: Wrong Answer

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

h = [int() for i in range(N)]

count = 0

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

ki = sorted(ki)
#print(ki)
#print(N-(ki.index(K)))

def my_index(l, x, default=-1):
    if x in l:
        return l.index(x)
    else:
        return default
ans = my_index(ki,K)
if(ans!=-1):
  print(N-ans)
else:
  if(K<min(ki)):
    print(N)
  else:
    print(0)

Submission status: Wrong Answer

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: Wrong Answer

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

h.sort()

left = 0
right = len(h) - 1
center = 0

while right - left >= 2:
    center = int((left + right) / 2)
    if h[center] >= K:
        right = center
    else:
        left = center
    
print(center + 1)

Submission status: Wrong Answer

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

h.sort()

left = 0
right = len(h) - 1
center = 0

while right - left >= 2:
    center = int((left + right) / 2)
    print(center)
    if h[center] >= K:
        right = center
    else:
        left = center
    
print(center + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import bisect

N, K = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h)
print(N - bisect.bisect_right(h,K))

Submission status: Wrong Answer

Solution code:
N, K = map(int, input().split())
h = list(map(int, input().split()))
h = sorted(h, reverse=True)
for i, h_i in enumerate(h):
  if h_i < K:
    print(i)
    exit()

Submission status: Wrong Answer

Solution code:
n, k = input().split()
n = int(n)
K = int(k)
h = input().split()
ninzu = 0

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

print(ninzu)

Submission status: Wrong Answer

Solution code:
N, K, *H = map(int, open(0).read().split())
print(sum([1 for i in range(N) if i >=K]))

Submission status: Wrong Answer

Solution code:
N, K, *H = map(int, open(0).read().split())
count = 0
for i in range(N):
  if i >= K:
    count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = [int(i) for i in input().split()]
count = 0

print(N)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
num, jet = (input().split())

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

for n in height:
    if n > int(jet):
        ans += 1
    else:
        continue

print(ans)

Submission status: Wrong Answer

Solution code:
num, jet = (input().split())

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

for n in height:
    if n > int(jet):
        ans += 1
    else:
        break

print(ans)

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import re

num, lim = input().split()
x = re.split(' +', input())
x = x[:int(num)]
print(len([person for person in x if person >= lim]))

Submission status: Wrong Answer

Solution code:
import re

num, lim = input().split()
x = re.split(' +', input())
print(len([person for person in x if person >= lim]))

Submission status: Wrong Answer

Solution code:
num, lim = input().split()
x = input().split()
# print(len([person for person in x if person >= lim]))
sum = 0
for person in x:
    if person >= lim:
        sum += 1
        
print (sum)

Submission status: Wrong Answer

Solution code:
num, lim = input().split()
x = input().split()
print(len([person for person in x if person >= lim]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K = map(int,input().split())
h = list(map(int,input().split()))
h = [100,200,300,400,500]
counter = 0
for ph in h:
    if ph >= K:
        counter+= 1
print(counter)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

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