Apartments

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <vector>

using namespace std;

int main (int argc, char *argv[]) {
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> desired(n);
    for (int i = 0; i < n; i++) {
        cin >> desired[i];
    }

    vector<int> sizes(m);
    for (int i = 0; i < m; i++) {
        cin >> sizes[i];
    }

    sort(begin(desired), end(desired));
    sort(begin(sizes), end(sizes));

    /*vector<bool> reserved(n, 0);*/
    int count = 0;
    int i = 0, j = 0;
    while (j < n && i < m) {
        int lb = sizes[i] - k;
        int ub = sizes[i] + k;
        /*cout << "lb: " << lb << " ub: " << ub << "\n";*/
        if (lb > desired[j]) {
            j++;
            continue;
        }
        if (desired[j] > ub) {
            i++;
            continue;
        }

        if (desired[j] >= lb && desired[j] <= ub) {
            /*reserved[j] = true;*/
            count++;
            i++;
            j++;
            continue;
        }
    }
    /*for (int i = 0; i < m; i++) {*/
    /*    int lb = sizes[i] - k;*/
    /*    int ub = sizes[i] + k;*/
    /*    for (int j = 0; j < n; j++) {*/
    /*        if (desired[j] >= lb && desired[j] <= ub && !reserved[j]) {*/
    /*            reserved[j] = true;*/
    /*            count++;*/
    /*            break;*/
    /*        }*/
    /*    }*/
    /*}*/

    std::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