Apartments

import sys
input_data = sys.stdin.read().split()

n_applicants = int(input_data[0])
m_apparments = int(input_data[1])
k_maxdiff = int(input_data[2])

acceptable_sizes = [int(input_data[i]) for i in range(3,3+n_applicants)]
appartments = [int(input_data[i]) for i in range(3+n_applicants,3+n_applicants+m_apparments)]

taken = [0]*m_apparments
left = m_apparments

sorted_apps = sorted(appartments)
sorted_applicants = sorted(acceptable_sizes)


#using binary search 

applicant = 0
appartment = 0
count = 0
while(applicant < n_applicants and appartment < m_apparments):
    acceptable_size =  sorted_applicants[applicant] 
    if abs(appartments[appartment] - acceptable_size) <= k_maxdiff:
        appartment+=1
        applicant+=1
        count+=1
        #appartment was claimed
    elif appartments[appartment] < acceptable_size:
        appartment+=1
    else :
        #if it was too big, we check if next person can afford it
        applicant+=1

print(count)

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED