Submission #65535975

---

Source Code Expand

N,M=map(int,input().split())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=B.copy();C.sort();C.reverse()

from collections import deque
E=deque()
D={}

for i in range(M):
  E.append(C[i])

for i in range(N):
  while True:
    if A[i] <= E[0]:
      D[E[0]]=i+1
      E.popleft()
    else:
      break
    if len(E)==0:
      break
  if len(E)==0:
      break

for i in range(M):
  if B[i] in D:
    print(D[B[i]])
  else:
    print(-1)

Submission Info

Judge Result