Apartments

n, m, k = map(int, input().split())
#the number of applicants, the number of apartments, 
# and the maximum allowed difference.
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a.sort()
b.sort()
res = 0

def binarySearch(arr, targetVal):
  left = 0
  right = len(arr) - 1

  while left <= right:
    mid = (left + right) // 2

    if arr[mid] == targetVal:
      return mid

    if arr[mid] < targetVal:
      left = mid + 1
    else:
      right = mid - 1

  return -1

for i in range(len(a)):
    ranges = list(range(a[i] - k, a[i] + k + 1))
    #print(ranges)
    for j in range(len(ranges)):
        found = binarySearch(b, ranges[j])
        if found != -1:
           break
    #found = binarySearch(b, a[i])
    if found != -1:
        res += 1
        #print(b[found])
        b.remove(b[found])

print(res)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: RUNTIME ERROR

Test 13

Verdict: ACCEPTED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: RUNTIME ERROR

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED