TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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?

Submission attempts (in order):
n, k = map(int, input().split())
h = list(map(int, input().split()))
from bisect import bisect_left
rint(n - bisect_left(sorted(h),k))

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
# -*- coding: utf-8 -*-
import numpy as np
n,k = list(map(int,input().split()))
s = 0 

for i in range(n):
    h = int(input())
    if h >= k:
        s += 1
print(s)
exit(0)


# -*- coding: utf-8 -*-
import numpy as np
n,k = list(map(int,input().split()))
s = 0 

for i in range(n):
    h = int(input())
    if h >= k:
        s += 1
print(s)
exit(0)


# -*- coding: utf-8 -*-
import numpy as np 
n,k = list(map(int,input().split()))
h = list(map(int,input().split()))

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, k = input().split(" ")
h = input().split(" ")

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

n, k = input().split(" ")
h = input().split(" ")

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,k=int(input().split())
h=list(map(int,input().split()))
result=0
for i in range(n):
  if h[i]>=k:
    result+=1
print(result)


s,t=(int(x) for x in input().split())
n=list(map(int,input().split()))
k=0
for i in range(s):
    if t<=n[i]:
        k+=1
print(k)
    

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N ,K = int(input().strip().split())
a = list(map(int, input().strip().split()))
for i range (N):
  if a[i] >= K:
    p += 1
print(p)

N ,K = input().strip().split()
N = int(N)
K = int(K)
a = list(map(int, input().strip().split()))
for i range (N):
  if a[i] >= K:
    p += 1
print(p)

N ,K = input().strip().split()
N = int(N)
K = int(K)
a = list(map(int, input().strip().split()))
p = 0
for i range (N):
  if a[i] >= K:
    p += 1
print(p)

N ,K = input().strip().split()
N = int(N)
K = int(K)
a = []
a = list(map(int, input().strip().split()))
p = 0
for i range (N):
  if a[i] >= K:
    p += 1
print(p)

N ,K = input().strip().split()
N = int(N)
K = int(K)
a = list(map(int, input().strip().split()))
p = 0
for i range (N):
  if a[i] >= K:
    p += 
print(p)

N ,K = input().strip().split()
N = int(N)
K = int(K)
a = list(map(int, input().strip().split()))
p = 0
for i range (N):
  if a[i] >= K:
    p += 1
print(p)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
ipt=list(map(int, input().split()))

N=ipt[0]
K=ipt[1]
h=ipt[2:]

cnt=0
for n in range(N):
    if h[n]>=K:
        cnt+=1

print(cnt)


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

cnt=0
for n in range(N):
    if h[n]>=K:
        cnt+=1

print(cnt)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, K = input().split('')
N = int(N)
K = int(K)
h_list = input().split('')
h_list = [int(x) for x in hlist]

# N=1
# K=500
# h_list=[499]

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

NK = input().split('')
N = int(NK[0])
K = int(NK[1])
h_list = input().split('')
h_list = [int(x) for x in hlist]

# N=1
# K=500
# h_list=[499]

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

NK = input().split('')
N = int(NK[0])
K = int(NK[1])
h_list = input().split('')

# N=1
# K=500
# h_list=[499]

person = 0
for n in range(N):
    if int(h_list[n]) >= K:
        person+=1
    
print(person)

N, K = (int(i) for i in input().split())  
h_list = [int(i) for i in input().split()] 

person = 0
for n in range(N):
    if int(h_list[n]) >= K:
        person+=1
    
print(person)


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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))


import sys

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

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

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

print(len(oks))


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,k = list(map(int,input().split()))
h = list(map(int,input()))

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

print(cnt)

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)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
# -*- coding: utf-8 -*-

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

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

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


print(cnt)


# -*- coding: utf-8 -*-

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

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

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


print(cnt)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,K = (int(i) for i in input().split())
H = [int(i) for i in input().split()]

c=0
for _ in range(N):
    if (H[N]>=K):
        c=c+1

print(c)

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

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

print(c)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,k=map(int,input().split())
h=list(map(int,input().split()))
ans=0
for i in h;
  if i>=k:
    ans+=1
pront(ans)

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)


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)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
A=B=int(input())
N = list(int,input().split())

c=0

for i in range(A):
  if N[i] >= B:
    c+=1
  else:
    pass
  i+=1
print(c)

A,B=map(int,input().split())
N = list(map(int,input().split()))

c=0

for i in range(A):
  if N[i] >= B:
    c+=1
  else:
    pass
  i+=1
print(c)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, k = map(int, input())
array = list(map(int, input()))

goukei = 0
for i in range(len(array)):
	if array[i] >= k:
		goukei += 1

print(goukei)

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

goukei = 0
for i in range(len(array)):
	if array[i] >= k:
		goukei += 1

print(goukei)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
k = int(input())
count = 0
for i in range(n):
    if int(input()) >= k:
        count += 1

print(count)


n, k = [int(x) for x in input().split(' ')]
friends = [int(x) for x in input().split(' ')]
count = 0
for friend in friends:
    if friend >= k:
        count += 1
print(count)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,K = input().split()
N = int(N)
K = int(K)

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

count = 0

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

print(count)




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

h = input().split()

count = 0

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

print(count)




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)



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)





Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(map(str, input().split()))
def pl(a): print(" ".join(list(map(str, a))))
def ma():return map(int,input().split())
def nli(x):return [input for _ in range(x)]
def hukusuu(): 
  listA=[] 
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break 
  return listA

n,k=ma()
h=rli()

from itertools import accumulate , groupby as acc , gp
import operator as op
import copy as cp
import math
from bisect import bisect_left as bisl
from bisect import bisect_right as bisr
def ifif(s):
  if s:print("Yes")
  else:print("No")

h.sort()
inde=bisl(h,k)
print(n-inde)  




def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(map(str, input().split()))
def pl(a): print(" ".join(list(map(str, a))))
def ma():return map(int,input().split())
def nli(x):return [input for _ in range(x)]
def hukusuu(): 
  listA=[] 
  while True:
    try:listA.append(list(map(int,input().split())))
    except:break 
  return listA

n,k=ma()
h=rli()

from itertools import accumulate as acc 
import operator as op
import copy as cp
import math
from bisect import bisect_left as bisl
from bisect import bisect_right as bisr
def ifif(s):
  if s:print("Yes")
  else:print("No")

h.sort()
inde=bisl(h,k)
print(n-inde)  





Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N,K=[int(i) for i in input().split()]
h = [int(i) for i in input().split()]
smy = 0

for i in h:
  if !(h<K):
    smy+=1:
print(smy)

N,K=[int(i) for i in input().split()]
h = [int(i) for i in input().split()]
smy = 0
 
for i in h:
  if not(i<K):
    smy+=1
print(smy)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,k=map(int,input().split())
h=map(int,input().split())
x=0
for i in range(0,len(h)):
  if h[i]>=k:
    x+=1

print(x)      
 

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

print(x)      
 

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

print(x)      
 


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import numpy as np
N = list(map(int, input().split()))
A = list(map(int, input().split())) 
numb = N[0]
bord = N[1]

A_p =np.array(A)
count =0

for n in range(numb):
    if A_p[n] > bord:
        count +=1
        
print(count)


import numpy as np
N = list(map(int, input().split()))
A = list(map(int, input().split())) 
numb = N[0]
bord = N[1]

A_p =np.array(A)
count =0

for n in range(numb):
    if A_p[n] >= bord:
        count +=1
        
print(count)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,k = (int(x) for x in input().split())
h = list(map(int, input().split()))

h.sort()
print(h[0])
i=0
while h[i]<k:
  i+=1

print(n-i)

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

h.sort()
i=0
while h[i]<k:
　　i+=1

print(n-i)

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)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
str = input().split()

n = int(str[0])
k = int(str[1])

str2 = input().split()

c = 0

for s in str2:
    i = int(s)
    if i > k:
        c += 1

print(c)


str = input().split()

n = int(str[0])
k = int(str[1])

str2 = input().split()

c = 0

for s in str2:
    i = int(s)
    if i >= k:
        c += 1

print(c)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, k = map(int, input().split())
h = [int(input()) for _ in range(n)]
ans = 0
for i in h:
    for i >= k:
        ans += 1
print(ans)

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

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)


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

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


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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?

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

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)


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
f __name__ == '__main__':
    N, K = map(int, input().split())
    people_hight = list(input().split())
    ok = 0

    for person_hight in people_hight:
        if K <= int(person_hight) :
            ok = ok + 1
    print(ok)


if __name__ == '__main__':
    N, K = map(int, input().split())
    people_hight = list(input().split())
    ok = 0

    for person_hight in people_hight:
        if K <= int(person_hight) :
            ok = ok + 1
    print(ok)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
s = 0
print(a)
for i in range(n):
    if a[i] >= k:
        s += 1
    else:
        print(s)
        exit(0)
print(s)

n, k = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
s = 0
for i in range(n):
    if a[i] >= k:
        s += 1
    else:
        print(s)
        exit(0)
print(s)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,k=map(int,input().split())
h=list(map(int,input().split()))
c=0
for x in h:
  c += x>=h
print(c)

n,k=map(int,input().split())
h=list(map(int,input().split()))
c=0
for x in h:
  c += x>=k
print(c)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)
         

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)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
k = 0
g = 0
for i in range(1,n+1) :
    if i % 2 == 0:
        g += 1
    else :
        k += 1
print(k/(g+k))

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, k = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for h in H:
    if h >= k:
        cn
        t += 1
print(cnt)

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)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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

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

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)

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, k = map(int, input().split())
H = list(map(int, input().split()))
cnt = 0
for i in n:
    if H[i] >= k:
        cnt += 1
print(cnt)


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


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)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
i=input;s=split;n,k=i().s();l=[int(_) for _ in i().s()];c=0
for _ in l:
  if _>int(~-k):
    c+=1
print(c)

i=input;n,k=i().split();l=[int(_) for _ in i().split()];c=0
for _ in l:
  if _>=int(k):
    c+=1
print(c)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,k = map(int,input().split())
h = list(ap(int,input().split()))
print(len([0 for x in h if x >= k]))


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

Verdicts: Runtime Error

Accepted
Problem: 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?

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

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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)

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)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
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)

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)


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)

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
a = list(map(int,input().split()))
N = a[0]
K = a[1]

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

b = [5,3,6,2,4,6]
for i in range(len(b)):
    for j in range(len(b)):
        if b[i]<b[j]:
            x = b[i]
            b[i] = b[j]
            b[j] = x

c = 0
for k in b:
    if k < K:
        break
    c += 1

print(c)

a = list(map(int,input().split()))
N = a[0]
K = a[1]

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

for i in range(len(b)):
    for j in range(len(b)):
        if b[i]<b[j]:
            x = b[i]
            b[i] = b[j]
            b[j] = x

c = 0
for k in b:
    if k < K:
        break
    c += 1

print(c)
    

a = list(map(int,input().split()))
N = a[0]
K = a[1]

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

for i in range(len(b)):
    for j in range(len(b)):
        if b[i]<b[j]:
            x = b[i]
            b[i] = b[j]
            b[j] = x
c = 0
for k in b:
    if k < K:
        break
    c += 1

print c

a = list(map(int,input().split()))
N = a[0]
K = a[1]

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

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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

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

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)

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)


Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n,k = map(int,input().split())
lis = [int(e) for i in input().split()]

c = 0
for i in lis:
        if i >= e:
            c += 1
print(c)


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

n,k = map(int,input().split())
lis = [int(i) for i in input().split()]

c = 0
for i in lis:
        if i >= k:
            c += 1
print(c)


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)



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)


num, jet = map(int, input().split())

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

ans = 0

for n in height:
    if n >= jet:
        ans += 1

print(ans)


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n = int(input())
count = 0
lia = []
lib = list(map(int,input().split()))
for i in range(1,n+1):
    lia.append(i)
for i in range(n):
    if lia[i] != lib[i]:
        count += 1
    if count > 3:
        print("NO")
        break
if count <= 2:
    print("YES")

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
import bisect

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

import bisect

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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
n, k = list(map(lambda x: int(x), input().split()))
height = list(map(lambda x: int(x), input().split()))
count = 0

for i in range(len(height)):
    if height[i] > k:
        count += 1
    
print(count)



n, k = list(map(lambda x: int(x), input().split()))
height = list(map(lambda x: int(x), input().split()))
count = 0

for i in range(len(height)):
    if height[i] >= k:
        count += 1
    
print(count)



Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N, K = map(int,input().split())
h = map(int,input().split())
count = 0
for i in range(N):
  if K <= h[i]:
    count = count + 1
  else:
    continue
    
print(count)

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n,k=map(int,input().split())
lst=[k<h int(h) for h in input().split()]
x=len(lst)
print(x)

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


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


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


Verdicts: Runtime Error

Wrong Answer

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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

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

print(len)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
a,b=map(int,input().split())
list_s=[]
list_s.append=map(int,input().split())

print(list_s>=b)

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

Verdicts: Runtime Error

Accepted
Problem: 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?

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

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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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?

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

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


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
a,b=map(int,input().split())
height=list(input())
count=0
for i in range (a):
    if height[i]>=b:
       count+=count
print(count)

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


Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n, k = map(int,input().split())
h = list(map(int,input().split()))
c = 0

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

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)

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)

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)

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N,K = int(input()).split()
h = [int(input()) for i in range(N)]
r = 0
for j in range(N):
  if h[j] >= K:
    r += 1
print(r)


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

N,K = input().split()
N = int(N)
K = int(K)
h = [input().split()]
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)


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


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


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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):

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)



import bisect

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

H.sort()

idx = bisect.bisect_left(H, K)

print(N-idx)


Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
N = int(input())
K = int(input())
ans = 0
for i in range(N):
  h = int(input())
  if h >= K:
    ans += 1
    
print(ans)

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

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

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

N = int(input())
K = int(input())
ans = 0
for i in range(N):
  if input() >= K:
    ans += 1
    
print(ans)

N = int(input())
K = int(input())
ans = 0
for i in range(N):
  if int(input()) >= K:
    ans += 1
    
print(ans)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
N, K = map(int, input().split())
h = map(int,input().split())

ans = 0

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


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

ans = 0

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

Verdicts: Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
_,k = map(int, input().split())
print(sum(1 for h in map(int, input().split() if h >= k)))

_,k = map(int, input().split())
print(sum(1 for h in map(int, input().split()) if h >= k)))

_,k = map(int, input().split())
print(sum(1 for h in map(int, input().split()) if h >= k))

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
n=int(input())
k=int(input())
h = list(map(int, input().split()))
sum = 0
for i in range(0,n):
    if h[i] >= k:
        sum =sum +1
print(sum)

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


Verdicts: Runtime Error

Accepted
Problem: 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?

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

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

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

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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?

Submission attempts (in order):
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)


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

Verdicts: Wrong Answer

Accepted
Problem: 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?

Submission attempts (in order):
nk = [int(e) for e in input().split(" ")]
h = [int(f) for f in input().split()]
c = 0
for e_h in h: if nk[1] <= e_h: c += 1
print(c)

k = int(input().split(" ")[1])
c = 0
for e_h in [int(e) for e in input().split()]:
    if(k <= e_h): c += 1
print(c)

Verdicts: Runtime Error

Accepted