Apartments

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

int main(){
    int n,m,k;
    cin >> n >> m >> k;
    vector<int> aplicants(n);
    vector<int> aparments(m);
    for (int i = 0; i < n; i ++){
        cin >> aplicants[i];
    }
    sort(aplicants.begin(),aplicants.end());
    for(int i = 0; i < m; ++i){
        cin >> aparments[i];
    }
    sort(aparments.begin(),aparments.end());
    int i = 0;
    int j = 0;
    int assig = 0;
    while(i < n and j < m){
        int act_min = aplicants[i] - k;
        int act_max = aplicants[i] + k;
        if(act_min <= aparments[j] and act_max >= aparments[j]){
            ++i;
            ++j;
            ++assig;
        }
        else if(act_min > aparments[j]){
            ++j;
        }
        else if(act_max < aparments[j])
            ++i;
    }
    cout << assig <<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