Apartments

#include <iostream>
#include <vector>
#include <bits/stdc++.h>

using namespace std;

int main(){
    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(desired.begin(), desired.end());

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

    unsigned int d_idx = 0;
    unsigned int s_idx = 0;

    unsigned int count = 0;

    while((d_idx != desired.size()) and (s_idx != sizes.size())){
        if((desired[d_idx]-k <= sizes[s_idx]) and (desired[d_idx]+k >= sizes[s_idx])){
            count += 1;
            d_idx += 1;
            s_idx += 1;
        }
        else if (sizes[s_idx]<desired[d_idx]+k)
        {
            s_idx += 1;
        }
        else{
            d_idx += 1;
        }
        
    }
    cout << count << 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