영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There are n applicants and m 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 n, m, and k: the number of applicants, the number of apartments, and the maximum allowed difference.
The next line contains n integers a_1, a_2, …, a_n: the desired apartment size of each applicant. If the desired size of an applicant is x, they will accept any apartment whose size is between x-k and x+k.
The last line contains m integers b_1, b_2, …, b_m: the size of each apartment.
Output
Print one integer: the number of applicants who will get an apartment.
Constraints
- 1 ≤ n, m ≤ 2 · 10^5
- 0 ≤ k ≤ 10^9
- 1 ≤ a_i, b_i ≤ 10^9
예제
예제 1
4 3 5 60 45 80 60 30 60 75
2