Apartments

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define die(x) return cout << x << endl, 0
#define all(o) o.begin(), o.end()
#define endl '\n'
#define IOS ios::sync_with_stdio(0), cin.tie(0)
#define FILE freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define SZ(x) ((int)(x).size())
typedef long double ld;
typedef long long ll;
int gcd(int x,int y){ return (!y ? x : gcd(y, x%y)); }
int to_int(string sconvert){stringstream geek(sconvert);int xconvert = 0; geek >> xconvert; return xconvert;}
const int MAXN=200000+30,MAX_LOG=40,INF=1e18+10,MOD=1e9+7;
const double PI = acos(-1);
int mod(int x) { return (x % MOD + MOD) % MOD; }
int power(int x,int y){
    if(y==0)return 1;
    int c=power(x,y/2);
    c=(c*c)%MOD;
    if(y%2)c=(c*x)%MOD;
    return c;
}

int a[MAXN], b[MAXN];

int MAIN(){
    int n, m, k;
    cin>>n>>m>>k;
    for (int i = 0; i < n; i++){
        cin>>a[i];
    }
    for (int i = 0; i < m; i++){
        cin>>b[i];
    }
    int ptr_1 = 0, ptr_2 = 0;
    sort(a, a+n);
    sort(b, b+m);
    int success = 0;
    while(ptr_1 < n && ptr_2 < m){
        if(abs(a[ptr_1]-b[ptr_2]) <= k){
            ptr_1++;
            ptr_2++;
            success++;
        }
        else if(a[ptr_1] < b[ptr_2]){
            ptr_1++;
        }
        else{
            ptr_2++;
        }
    }
    cout << success << endl;
    return 0;
}
int32_t main(){
    IOS;
    int t=1;
    // cin>>t;
    while(t--)MAIN();
    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