Submission #18,603

2025-10-28 13:42:35

python3

Wrong answer 15/40

104ms

15684 KiB

n, q = map(int, input().split())
t = tuple(map(int, input().split()))
m = list(int(input()) for _ in range(q))

maxti = 0
maxt = list()

for i in range(n):
    if maxti < t[i]:
        maxti = t[i]
    maxt.append(maxti)
output = 0
i = 0
for mi in m:
    while mi >= maxt[i]:
        i += 1
    print(i+1)

	Sum	Test	Verdict		Time	Memory
base	15/40
		1	Accepted	0/0	14ms	3312 KiB
		2	Wrong answer	0/0	93ms	15144 KiB
		3	Accepted	2/2	14ms	3132 KiB
		4	Accepted	2/2	16ms	3124 KiB
		5	Accepted	2/2	17ms	3208 KiB
		6	Accepted	2/2	19ms	3408 KiB
		7	Accepted	3/3	18ms	3476 KiB
		8	Wrong answer	0/3	104ms	15664 KiB
		9	Wrong answer	0/3	104ms	15660 KiB
		10	Wrong answer	0/3	104ms	15660 KiB
		11	Wrong answer	0/4	104ms	15532 KiB
		12	Accepted	4/4	93ms	15680 KiB
		13	Wrong answer	0/4	104ms	15684 KiB
		14	Wrong answer	0/4	94ms	15660 KiB
		15	Wrong answer	0/4	98ms	15456 KiB