جست‌وجو در دنباله ۲

Main.py

n, q = map(int, input().split())
a = list(map(int, input().split()))

# M = a[1]
# for i in range(2, n):
#     M = max(M, a[i])
M = max(a)

cnt = [0 for i in range(M + 1)]

for i in range(0, n):
    cnt[a[i]] += 1

ps = [0 for i in range(M)]

for i in range(1, M):
    ps[i] = ps[i - 1] + cnt[i]


for i in range(q):
    x = int(input())

    if x > M:
        print(n)
    else:
        print(ps[x-1])