Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- from sys import stdin, stdout
- def solve(x, m):
- l = 0
- r = len(x) - 1
- ans = -1
- while l <= r:
- mid = (l + r) // 2
- if m >= x[mid]:
- ans = mid
- l = mid + 1
- else:
- r = mid - 1
- if x[ans] > m:
- return -1
- return ans
- n, m = map(int, stdin.readline().split())
- h = [-1] + list(map(int, stdin.readline().split()))
- h.sort()
- t = list(map(int, stdin.readline().split()))
- p = []
- for i in t:
- v = solve(h, i)
- if v == -1:
- p.append(str(v))
- else:
- r = h.pop(v)
- p.append(str(r))
- stdout.write("\n".join(p))
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement