ZhenlongDai/ACPR huggingface dataset:
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,m=map(int,input().split())
h=[int(_) for _ in input().split()]
print(len([i  for i in h if i<m]))

Failing test case input:
5 1
100 26 300 467 500

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
n,m=map(int,input().split())
h=[int(_) for _ in input().split()]
print(len([i  for i in h if i>=m]))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int,input().split())
h = list(map(int,input().split()))

count = 0
for person in h:
    if person > K:
        count += 1

print(count)

Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int,input().split())
h = list(map(int,input().split()))

count = 0
for person in h:
    if person >= K:
        count += 1

print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)



Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N, K = input().split()
height_list = input().split()
count = 0
for h in height_list:
    if h >= K:
        count += 1
print('{}'.format(count))


Failing test case input:
-1 1257
7

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):


N, K = map(int, input().split())
h_list = list(map(int, input().split()))
count = sum(h>=K for h in h_list)
print('{}'.format(count))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
5 0
100 71 476 467 131

Expected output:
5


Actual output:
10


Fixed submission (verdict: Accepted):
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 + 1
    else:
        total = total + 0
print(total)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
print(len(list(filter(lambda x:x>k,a))))


Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
n,k=[int(x) for x in input().split()]
a=list(map(int,input().split()))
print(len(list(filter(lambda x:x>=k,a))))
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N, K = input().split()
height_list = input().split()
count = sum([1 for h in height_list if h>=K])
print('{}'.format(count))


Failing test case input:
-1 1020
299

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):


N, K = map(int, input().split())
h_list = list(map(int, input().split()))
count = sum(h>=K for h in h_list)
print('{}'.format(count))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
0 599
163

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
5 4
000 200 300 467 500

Expected output:
4


Actual output:
2


Fixed submission (verdict: Accepted):
N, K = input().split()
n = int(N)
k = int(K)
h = [int(i) for i in input().split()]
ninzu = 0
for i in range(n):
  if h[i] >= k:
    ninzu = ninzu + 1 
print(ninzu)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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


Failing test case input:
5 1
100 328 300 400 603

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n ,k= input().split()
h = list(map(int,input().split()))
m=0
for i in range (int(n)):
    if h[i] < int(k):
        m+=1
print(m)

Failing test case input:
1 500
499

Expected output:
0

Actual output:
1


Fixed submission (verdict: Accepted):
n, k= input().split()
h = list(map(int,input().split()))
m=0
for i in range (int(n)):
    if h[i] >= int(k):
        m+=1
print(m)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):

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)


Failing test case input:
1 599
88

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):

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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)


Failing test case input:
0 668
106

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
data = input().split()
N = int(data[0])
K = int(data[1])
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):


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)


Failing test case input:
5 2
000 200 300 467 500

Expected output:
4


Actual output:
0
1
2
3
4
1


Fixed submission (verdict: Accepted):


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int, input().split())
print(N, K)

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

Failing test case input:
5 2
100 200 476 467 500

Expected output:
5


Actual output:
5 2
5


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())

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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
-1 604
17

Expected output:
0


Actual output:
-1


Fixed submission (verdict: Accepted):
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
if max(l)>=k:
  print(n-cnt)
else:
  print(0)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
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)


Failing test case input:
-1 266
57

Expected output:
0


Actual output:
3


Fixed submission (verdict: Accepted):
N,K = map(int,input().split())
h = list(map(int,input().split()))
counter = 0
for ph in h:
    if ph >= K:
        counter+= 1
print(counter)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
0 599
84

Expected output:
0


Actual output:
num: high: 0


Fixed submission (verdict: Accepted):
num, least = map(int,input().split())
high = [int(x) for x in input().split()]

high.sort(reverse = True)

count = 0
i = 0

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

print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int, input().split(' '))
h_list = list(map(int, input().split(' ')))
print(sum([h>K for h in h_list]))

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
1 599
88

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
m = list(map(int,input().split()))
N = m[0]
K = m[1]
h = list(map(int,input().split()))
count = 0
for i in h:
  if i >= K:
    count += 1
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
-1 450
61

Expected output:
0


Actual output:
-1


Fixed submission (verdict: Accepted):
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
if max(l)>=k:
  print(n-cnt)
else:
  print(0)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)



Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
0


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
s = 0
for i in range(n):
  if h[i]>k:
    s+=1
print(s)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
s = 0
for i in range(n):
  if h[i]>=k:
    s+=1
print(s)
Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    for i in range(len(sorted_heights)):
        if sorted_heights[i] < min_height:
            continue
        print(len(sorted_heights) - i)
        break

if __name__ == '__main__':
    main()

Failing test case input:
0 823
57

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    over_friends = 0

    for i in range(friends):
        if sorted_heights[i] < min_height:
            continue
        else:
            over_friends = friends - i
            break
    
    print(over_friends)

if __name__ == '__main__':
    main()

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = l[1]

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

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


if __name__ == "__main__":
    main()


Failing test case input:
1 599
88

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = int(l[1])

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

    count = 0
    for x in h:
        x = int(x)
        if x >= k:
            count += 1

    print(count)


if __name__ == "__main__":
    main()

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


def main():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    print(N, K, h)
    print(sum(1 for i in h if i >= K))


if __name__ == '__main__':
    main()


Failing test case input:
-4 500
56

Expected output:
0


Actual output:
-4 500 [56]
0


Fixed submission (verdict: Accepted):


def main():
    N, K = map(int, input().split())
    h = list(map(int, input().split()))
    print(sum(1 for i in h if i >= K))


if __name__ == '__main__':
    main()
Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    for i in range(friends):
        if sorted_heights[i] < min_height:
            continue
        else:
            print(friends - i)
            break

if __name__ == '__main__':
    main()

Failing test case input:
0 551
407

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
def main():
    friends, min_height = [int(i) for i in input().split()]
    input_heights = [int(i) for i in input().split()]

    sorted_heights = sorted(input_heights)

    over_friends = 0

    for i in range(friends):
        if sorted_heights[i] < min_height:
            continue
        else:
            over_friends = friends - i
            break
    
    print(over_friends)

if __name__ == '__main__':
    main()

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
5 1
100 200 476 465 500

Expected output:
5


Actual output:
5
5


Fixed submission (verdict: Accepted):
n,k=[int(x) for x in input().split()]
h = [int(y) for y in input().split()]
leng=len(h)
counter=0
for i in range(1,leng+1):

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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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))

Failing test case input:
-1 1020
299

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
canh = [num for num in h if k<=num]
print(len(canh))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
5 1
100 200 843 465 500

Expected output:
5


Actual output:
0 100
1 200
2 843
3 465
4 500
5


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())
h_n =list(map(int,input().split()))

ans = 0

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

print(ans)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N,K = input().split()
H = input().split()
print(sum([1 for h in H if h>=K]))

    







Failing test case input:
-1 385
57

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N,K = map(int,input().split())
H = list(map(int,input().split()))
print(sum([1 for h in H if h>=K]))
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = input().split()
l = list(int(i) for i in input().split())
count = 0
 
for i in l:
  if(i > int(K)):
    count = count + 1

print(count)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
N, K = input().split()
l = list(int(i) for i in input().split())
count = 0
 
for i in l:
  if(i >= int(K)):
    count = count + 1

print(count)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
N, K = map(int, input().split())
H = list(map(int, input().split()))

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

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())
H = list(map(int, input().split()))

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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
0 1020
262

Expected output:
0


Actual output:
[262]
0


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k = map(int,input().split())
l = list(map(int,input().split()))
print(sum(list(filter(lambda x:x>=k,l))))

Failing test case input:
5 2
000 200 300 467 500

Expected output:
4


Actual output:
1467


Fixed submission (verdict: Accepted):
n,k = map(int,input().split())
l = list(map(int,input().split()))
print(sum(map(lambda x: x>=k,l)))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N,K=map(int,input().split())
h=input().split()
S=0

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

print(S)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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


Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
-1 864
262

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)

Failing test case input:
0 604
17

Expected output:
0


Actual output:

Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
in1 = input()
in2 = input()





N,K = in1.split()

h_list = in2.split()




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

print(num)

Failing test case input:
0 1104
111

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())




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

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

print(num)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n,k=map(int,input().split())
l=list(map(int,input().split()))
o=[x for x in l if x>=k]
print(len(o))

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
print(sum(x > k for x in h))


Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = map(int, input().split())
h = [int(i) for i in input().split()]
print(sum(x >= k for x in h))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
5 0
100 71 476 467 131

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
n,k=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for b in a:
  if b>=k:
    ans+=1
print(ans)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k = map(int,input().split())

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

ans = 0

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

Failing test case input:
5 1
100 200 476 467 500

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K=map(int, input().split())
List=list(map(int,input().split())) 
print(sum(1 for x in List if x>K))

Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N,K=map(int, input().split())
List=list(map(int,input().split())) 
print(sum(1 for x in List if x>=K))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
0 912
163

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
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
  else:
    continue
if max(h) < K:
  a += N
print(N-a)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)    

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int,input().split())
H = input().split()
H_i = [int(h) for h in H]
print(sum(h>K for h in H_i))


Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int,input().split())
H = input().split()
H_i = [int(h) for h in H]

print(sum(h>=K for h in H_i))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, *H = map(int, open(0).read().split())
print(sum([1 for i in range(N) if i >=K]))

Failing test case input:
1 500
654

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
N, K, *H = map(int, open(0).read().split())
li = [i for i in H if i >= K]
print(len(li))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int,input().split())
b = input().split()

print(N)
print(K)
print(b)

passengers = 0

for i in b:
  if int(i) >= K:
    passengers += 1

print(passengers)

Failing test case input:
5 1
110 200 843 465 500

Expected output:
5


Actual output:
5
1
['110', '200', '843', '465', '500']
5


Fixed submission (verdict: Accepted):
N, K = map(int,input().split())
t = input().split()

passengers = 0

for i in t:
  if int(i) >= K:
    passengers += 1

print(passengers)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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
print(a)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = l[1]

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

    r = [x for x in h if x >= k]
    print(r.__len__())


if __name__ == "__main__":
    main()


Failing test case input:
-4 1020
299

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
def main():
    l = input().strip().split(" ")
    n = int(l[0])
    k = int(l[1])

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

    count = 0
    for x in h:
        x = int(x)
        if x >= k:
            count += 1

    print(count)


if __name__ == "__main__":
    main()

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):


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)


Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 1, 0
while i <= int(n):
  if h[-i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = input().split(' ')
h = input().split(' ')
h.reverse()
count = 0
for i in range(0, int(n)):
  if int(h[i]) >= int(k):
    count += 1
  else:
    pass
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K=input().split()

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

print(n)

Failing test case input:
1 599
84

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N,K=input().split()
N=int(N)
K=int(K)
h=input().split()
n=0
for i in range(N):
	tmph=int(h[i])
	if tmph >=K:
		n=n+1

print(n)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)


Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
listA=[] 
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        

print(listA[0],listA[1])
N,K=listA[0]
count=0
for h in listA[1]:
  if(K<=h):
    count=count+1
print(count)

Failing test case input:
-1 1196
163

Expected output:
0


Actual output:
[-1, 1196] [163]
0


Fixed submission (verdict: Accepted):
listA=[] 
while True:
    try:
        listA.append(list(map(int,input().split())))

    except:
        break;
        


N,K=listA[0]
count=0
for h in listA[1]:
  if(K<=h):
    count=count+1
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N, K = input().split()
height_list = input().split()
count = sum(h>=K for h in height_list)
print('{}'.format(count))


Failing test case input:
0 1104
111

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):


N, K = map(int, input().split())
h_list = list(map(int, input().split()))
count = sum(h>=K for h in h_list)
print('{}'.format(count))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
5 2
000 200 300 467 500

Expected output:
4


Actual output:
0


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
N,K = map(int, input().split())
S = sorted( list(map(int, input().split())) )
count=0

for i in S:
  if(i>K):
    count += 1
print(count)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
N,K = map(int, input().split())
S = sorted( list(map(int, input().split())) )
count=0

for i in S:
  if(i>=K):
    count += 1
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a = input().split()
b = input().split()

N = a[0]
K = a[1]

passengers = 0

for i in b:
  if i >= K:
    passengers += 1

print(passengers)

Failing test case input:
-1 1196
163

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int,input().split())
t = input().split()

passengers = 0

for i in t:
  if int(i) >= K:
    passengers += 1

print(passengers)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
count = 0
for i in range(0, int(n)):
  if h[i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
n, k = input().split(' ')
h = input().split(' ')
h.reverse()
count = 0
for i in range(0, int(n)):
  if int(h[i]) >= int(k):
    count += 1
  else:
    pass
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K, *h = open(0).read().split()
print(sum(1 for i in filter(lambda x: K <= x, h)))


Failing test case input:
0 668
84

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
N, K, *h = map(int, open(0).read().split())
print(sum(1 for i in filter(lambda x: K <= x, h)))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
i, count = 1, 0
while i <= len(h):
  if h[-i] >= int(k):
    count += 1
    i += 1
  else:
    break
print(count)

Failing test case input:
4 150
151 140 100 200

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = input().split(' ')
h = input().split(' ')
h.reverse()
count = 0
for i in range(0, int(n)):
  if int(h[i]) >= int(k):
    count += 1
  else:
    pass
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n, k = input().split(' ')
h = input().split(' ')
h = list(map(int, h))
h.reverse()
count = 0
for i in range(0, int(n)):
  if h[i] >= int(k):
    count += 1
  else:
    break
print(count)

Failing test case input:
4 150
150 139 100 332

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = input().split(' ')
h = input().split(' ')
h.reverse()
count = 0
for i in range(0, int(n)):
  if int(h[i]) >= int(k):
    count += 1
  else:
    pass
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K = input().split()

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

Failing test case input:
5 2
100 200 476 467 500

Expected output:
5


Actual output:
4


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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)    
  

Failing test case input:
1 364
638

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
n,k=map(int,input().split())
List=[int(i) for i in input().split()]
cnt=0
for i in range(0,n):
  if List[i]>=k:
    cnt=cnt+1
print(cnt)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
a,b=(int(x) for x in input().split())
X=input()
Y=X.split()
count=0

for i in range(len(Y)):
    if b<int(Y[i]):
        count=count+1
    ++i
print(count)

Failing test case input:
4 150
150 139 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
a,b=(int(x) for x in input().split())
X=input()
Y=X.split()
count=0

for i in range(len(Y)):
    if b<=int(Y[i]):
        count=count+1
    ++i
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
0 912
163

Expected output:
0


Actual output:
[163]
0


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)    

Failing test case input:
5 2
100 200 300 467 500

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):


N, K = input().split()
h_list = input().split()
count = 0
for h in h_list:
    if(h >= K):
        count += 1


print(count)


Failing test case input:
-1 1196
163

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):


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

print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()

count = 0

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


Failing test case input:
5 1
101 86 476 302 500

Expected output:
5


Actual output:
4


Fixed submission (verdict: Accepted):
n,k = map(int,input().split())
h = list(map(int,input().split()))
h.sort()

count = 0

for i in range(n-1,-1,-1):
  if h[i] >= k:
    count +=1
  else:
    break
print(count)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
1 364
638

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
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)
Problem: p02898
Buggy submission (PyPy3 (2.4.0), verdict: Wrong Answer):
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)

Failing test case input:
1 500
638

Expected output:
1


Actual output:
0


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 112
150 140 100 200

Expected output:
3


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N, K = map(int, input().split())

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

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


Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
N, K = map(int, input().split())

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

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

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)


Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
1


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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))


Failing test case input:
-1 641
163

Expected output:
0


Actual output:
[163]
0


Fixed submission (verdict: Accepted):
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))

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)


Failing test case input:
5 1
100 200 476 302 500

Expected output:
5


Actual output:
0


Fixed submission (verdict: Accepted):


n, k = map(int, input().split())
H = list(map(int, input().split()))
ct = 0
for i in range(n):
    if H[i] >= k:
        ct += 1
print(ct)
Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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()
    

Failing test case input:
5 1
101 86 476 302 500

Expected output:
5


Actual output:

Fixed submission (verdict: Accepted):
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:
    continue
  else:
    print(i)
    exit()

print(N)

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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)


Failing test case input:
0 551
299

Expected output:
0


Actual output:
299
0


Fixed submission (verdict: Accepted):


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

Problem: p02898
Buggy submission (Python (3.8.2), verdict: Wrong Answer):
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:]))

Failing test case input:
-1 385
57

Expected output:
0


Actual output:
1


Fixed submission (verdict: Accepted):
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
if list_h[-1] < k:
    print("0")
    exit()
count = 0
for count in range(0, n):
    if list_h[count] >= k: break
print(len(list_h[count:]))

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
N,K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
cnt = 0
for h in H:
  if(h>K):
    cnt += 1
print(cnt)

Failing test case input:
4 150
150 140 100 200

Expected output:
2

Actual output:
1


Fixed submission (verdict: Accepted):
N,K = [int(x) for x in input().split()]
H = [int(x) for x in input().split()]
cnt = 0
for h in H:
  if(h>=K):
    cnt += 1
print(cnt)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)


Failing test case input:
5 2
100 200 300 467 500

Expected output:
5


Actual output:
3


Fixed submission (verdict: Accepted):
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)

Problem: p02898
Buggy submission (Python (3.4.3), verdict: Wrong Answer):
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)

Failing test case input:
4 150
150 140 100 282

Expected output:
2


Actual output:
3


Fixed submission (verdict: Accepted):
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
  else:
    continue
if max(h) < K:
  a += N
print(N-a)