Apartments

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;


int main() {
    ll n, m, k;
    cin >> n;
    cin >> m;
    cin >> k;

    ll appl[n];
    ll apart[m];

    ll tmp;
    for(ll i = 0; i<n; i++) {
        cin >> tmp;
        appl[i] = tmp;
    }
    for(ll i = 0; i<m; i++) {
        cin >> tmp;
        apart[i] = tmp;
    }

    sort(appl, appl+n);
    sort(apart, apart+m);

    ll nbr = 0;
    ll i = 0;
    ll j = 0;
    while(i < n && j < m) {
        if(appl[i] < apart[j] - k) {
            i++;
        } else if(appl[i] > apart[j] + k) {
            j++;
        } else {
            nbr++;
            i++; 
            j++;
        }
    }
    cout << nbr <<"\n";
}

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