Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

cnt = 0
l = []
for i in P:
	l.append(i)
	if i == min(l):
		cnt += 1
print(cnt)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
N = int(input())
P = list(map(int, input().split()))

ntk = 0
l = []
for i in P:
	l.append(i)
	if i = min(l):
		cnt += 1
print(cnt)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
N = int(input())
P = list(map(int, input().split()))
cnt = 0
nl = np.array(P)
for i in range(N):
  if np.all(nl[:i+1] >= P[i]):
    cnt += 1
print(cnt)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
import numpy as np
N = int(input())
P = list(map(int, input().split()))
cnt = 0
for i in range(N):
  if np.all(nl[:i+1] >= l[i]):
    cnt += 1
print(cnt)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))
ans = 0
for i in P:
    cnt = 0
    r = 0
    for j in P:
        r += 1
        if i > j:
            continue
        cnt += 1
        if i == j:
            break
    if cnt == r:
        ans += 1
print(ans)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

# l = []
# for i in range(1, N+1):
#     m = []
#     for j in range(1, i+1):
#         m.append(j)
#     l.append(m)

ans = 0
for i in range(1, N+1):
    Pi = P[i - 1]
    chk = 0
    num = 0
    for j in range(1, i+1):
        num += 1
        Pj = P[j - 1]
        if Pi > Pj:
            continue
        else:
            chk += 1
    if chk == num:
        ans += 1

print(ans)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

# l = []
# for i in range(1, N+1):
#     m = []
#     for j in range(1, i+1):
#         m.append(j)
#     l.append(m)

ans = 0
for i in range(1, N+1):
    Pi = P[i - 1]
    chk = 0
    num = 0
    for j in range(1, i+1):
        num += 1
        Pj = P[j - 1]
        if Pi > Pj:
            continue
        else:
            chk += 1
    if chk == num:
        ans += 1

print(ans)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

cnt = 0
mi = P[0]
for i in range(N):
	if P[i] <= mi:
		mi = P[i]
		cnt += 1
print(cnt)