Apartments

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

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

    vector<int> wants(n);
    for(int i=0; i < n; i++) {
        int a; cin >> a;
        wants[i]=a;
    }
    vector<int> haves(m);
    for(int i=0; i < m; i++) {
        int b; cin >> b;
        haves[i]=b;
    }
    sort(wants.begin(), wants.end());
    sort(haves.begin(), haves.end());
    int i=wants.size()-1, j=haves.size()-1;
    int count = 0;
    while(i>= 0 && j>= 0) {
        if(abs(haves[j] - wants[i]) <= k) {
            count++;
            j--; i--;
        }
        else if(wants[i] > haves[j]) i--;
        else j--;
    }
    cout << count << '\n';
    return 0;
}

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