Apartments
There are applicants and free apartments. Your task is to distribute the apartments so that as many applicants as possible will get an apartment.
Each applicant has a desired apartment size, and they will accept any apartment whose size is close enough to the desired size.
Input
The first input line has three integers , , and : the number of applicants, the number of apartments, and the maximum allowed difference.
The next line contains integers : the desired apartment size of each applicant. If the desired size of an applicant is , he or she will accept any apartment whose size is between and .
The last line contains integers : the size of each apartment.
Output
Print one integer: the number of applicants who will get an apartment.
Constraints
Input:
Output:
Each applicant has a desired apartment size, and they will accept any apartment whose size is close enough to the desired size.
Input
The first input line has three integers , , and : the number of applicants, the number of apartments, and the maximum allowed difference.
The next line contains integers : the desired apartment size of each applicant. If the desired size of an applicant is , he or she will accept any apartment whose size is between and .
The last line contains integers : the size of each apartment.
Output
Print one integer: the number of applicants who will get an apartment.
Constraints
Input:
4 3 5
60 45 80 60
30 60 75
Output:
2
0 Comments
If you have any doubts/suggestion/any query or want to improve this article, you can comment down below and let me know. Will reply to you soon.