Apartments

#include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <utility>
#include <vector>

using namespace std;

int main (int argc, char *argv[]) {
    int n, m, k;
    cin >> n >> m >> k;

    vector<int> desired(n);
    for (int i = 0; i < n; i++) {
        cin >> desired[i];
    }

    vector<int> sizes(m);
    for (int i = 0; i < m; i++) {
        cin >> sizes[i];
    }

    vector<bool> reserved(n, 0);
    int count = 0;
    for (int i = 0; i < m; i++) {
        int lb = sizes[i] - k;
        int ub = sizes[i] + k;
        /*cout << "lb: " << lb << " ub: " << ub << "\n";*/
        for (int j = 0; j < n; j++) {
            /*cout << "desired: " << desired[j] << "\n";*/
            if (desired[j] >= lb && desired[j] <= ub && !reserved[j]) {
                reserved[j] = true;
                count++;
                break;
            }
        }
    }

    std::cout << count << "\n";
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: TIME LIMIT EXCEEDED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED