CSES-Problem-Set-Solutions/21. Apartments.cpp at main · D-Ajay-Kumar/CSES-Problem-Set-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int main()
{
    ll matched = 0;

    ll n, m, k;
    cin >> n >> m >> k;

    vector<ll> rSize, aSize;
    ll elem;

    for(ll i=0; i<n; i++)
    {
        cin >> elem;
        rSize.push_back(elem);
    }

    for(ll i=0; i<m; i++)
    {
        cin >> elem;
        aSize.push_back(elem);
    }

    sort(rSize.begin(), rSize.end());
    sort(aSize.begin(), aSize.end());

    for(ll i=0, j=0; i<n && j<m;)
    {
        if( (rSize[i]-k <= aSize[j]) && (rSize[i]+k >= aSize[j]) )
        {
            matched += 1;
            i += 1;
            j += 1;
        }
        else if(rSize[i] > aSize[j])
        {
            j += 1;
        }
        else
        {
            i += 1;
        }
    }

    cout << matched << "\n";

    return 0;
}