Apartments

#include <bits/stdc++.h>
using namespace std;
const int N = 200002;
vector<int> cl;
vector<int> ap;
int n, m ,k;

int bins(int t) {
	int b = 0;
	for (int i=n/2; i>=1; i/=2) {
		while (b+i < n && cl[b+i] < t) {
			b += i;
		}
	}
	if (cl[b+1]-2*k <= t && cl[b+1] >= t) {
		cl[b+1] = -999;
		return 1;
	}
	return 0;
}

int main() {
	cin >> n >> m >> k;
	int tem;
	cl.push_back(-999);
	for (int i=0;i<n;i++) {
		cin >> tem;
		cl.push_back(tem + k);
	}
	for (int i=0;i<m;i++) {
		cin >> tem;
		ap.push_back(tem);
	}
	sort(cl.begin(), cl.end());
	sort(ap.begin(), ap.end());

	int g = 0;
	for (int a : ap) {
		g += bins(a); 	
	}
	cout << g;
}

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