Apartments

#include <iostream>
#include <vector>
#include <algorithm> 
using namespace std;

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

    //vector<vector<bool> > roads(c, vector<bool>(c, false));
    vector<int> size_applicant(n);
    vector<int> apartments(m);

    for (int i = 0; i < n; ++i) cin >> size_applicant[i];
    for (int i = 0; i < m; ++i) cin >> apartments[i];

    sort(size_applicant.begin(), size_applicant.end());

    sort(apartments.begin(), apartments.end());

    int ok = 0;
    int app = 0, apart = 0;
    while( app < n and apart < m) {
        
        int app_value = size_applicant[app];
        int apart_value = apartments[apart];
        //cout << app << "---" << apart << endl;
        //cout << app_value << "---" << apart_value << endl;

        
        if (apart_value - k > app_value) ++app;
        else if (app_value > apart_value + k) ++apart;
        else {
            ++ok; ++app; ++apart;
        }
    }

    cout << ok << endl;





}

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