Apartments

def apartments(n,m,k, desired_apt, available_apt):

    desired_apt.sort()
    available_apt.sort()
    
    count = 0
    i = 0  
    j = 0  
    
    while i < n and j < m:
        if abs(desired_apt[i] - available_apt[j]) <= k:
            count += 1
            i += 1
            j += 1
        elif desired_apt[i] < available_apt[j]:
            i += 1
        else:
            j += 1
    
    return count

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

desired_apt = list(map(int,input().split()))
available_apt = list(map(int,input().split()))

# print(desired_apt)
print(apartments(n,m,k,desired_apt,available_apt))
# Input:

# 4 3 5
# 60 45 80 60
# 30 60 75
# Output:
# 2

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED