Apartments

#include <iostream>
#include <queue>
#include <vector>

int main()
{
    // n, m, k
    int n_applicants, n_apartments, max_difference;
    std::cin >> n_applicants >> n_apartments >> max_difference;
    std::priority_queue<int> desired_sizes, sizes;
    for (int i = 0; i < n_applicants; i++)
    {
        int a;
        std::cin >> a;
        desired_sizes.push(a);
    }
    for (int i = 0; i < n_apartments; i++)
    {
        int b;
        std::cin >> b;
        sizes.push(b);
    }

    int found_apartments = 0;
    while (!desired_sizes.empty())
    {
        int desired_size = desired_sizes.top();
        desired_sizes.pop();
        while (!sizes.empty())
        {
            int size = sizes.top();
            sizes.pop();
            if (size - max_difference <= desired_size && desired_size <= size + max_difference)
            {
                found_apartments++;
                break;
            }
        }
    }

    std::cout << found_apartments << std::endl;

    return 0;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: ACCEPTED

Test 17

Verdict: WRONG ANSWER

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED