Apartments

#include "iostream"
#include "vector"
#include "algorithm"

int main() {
    int n, m, k;
    std::cin >> n >> m >> k;
    std::vector<int> wishes;
    int offers = 0;
    for (int i = 0; i < n; i++) {
        int a;
        std::cin >> a;
        wishes.push_back(a);
    }
    int min, max;
    bool change = true;
    for (int i = 0; i < m; i++) {
        int b;
        std::cin >> b;
        if (change) {
            min = *std::min_element(wishes.begin(), wishes.end()) - k;
            max = *std::max_element(wishes.begin(), wishes.end()) + k;
            change = false;
        }
        if (b < min || b > max) continue;
        for (int i = 0; i < n;) {
            if (wishes[i] - k <= b && b <= wishes[i] + k) {
                offers++;
                wishes.erase(wishes.begin() + i);
                n--;
                change = true;
                break;
            } else i++;
        }
    }
    std::cout << offers << std::endl;
}

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