Apartments

#include <algorithm>
#include <iostream>
#include <vector>
 
using namespace std;
 
bool fits(int size, int pref, int k)
{
    return pref - k <= size && size <= pref + k;
}
 
int main()
{
    ios::sync_with_stdio(false);
 
    int n = 0, m = 0, k = 0;
    cin >> n >> m >> k;
 
    vector<int> prefs(n);
    for (int i = 0; i < n; ++i)
        cin >> prefs[i];
 
    vector<int> sizes(m);
    for (int i = 0; i < m; ++i)
        cin >> sizes[i];
 
    sort(prefs.begin(), prefs.end());
    sort(sizes.begin(), sizes.end());
 
    int answer = 0;
    auto pref = prefs.begin();
    auto size = sizes.begin();
    while (pref < prefs.end() && size < sizes.end())
    {
        if (*size < *pref - k)
            ++size;
        else if (*size > *pref + k)
            ++pref;
        else
        {
            ++answer;
            ++pref;
            ++size;
        }
    }
 
    cout << answer;
 
    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