Apartments

n, m, k = map(int, input().split())
a = sorted(map(int, input().split()))
b = sorted(map(int, input().split()))

counter = 0

def bs(arr, l, h, x):
    if h >= l:
        mid = (h + l) // 2

        if arr[mid] >= x - 5 and arr[mid] <= x + 5:
            arr.pop(mid) 
            return 1
        elif arr[mid] > x + 5: 
            return bs(arr, l, mid - 1, x)
        else:
            return bs(arr, mid + 1, h, x)
    else:
        return 0

for i in range(len(a)):
    counter += bs(b, 0, len(b) - 1, a[i])

print(counter)

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED