Apartments

#include <bits/stdc++.h>

using namespace std;

//Definitions for quicker writing
#define REP(i,a,b) for (int i = a; i < b; i++)

//Typedefs for quicker writing
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

int main() {
	//IO optimization
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	//Input definition
	int n, m, k;
	
	//Read In
	cin >> n >> m >> k;

	int wishes[n];
	int apps[m];

	REP(i,0,n){
		cin >> wishes[i];
	}

	REP(i,0,m){
		cin >> apps[i];
	}

	//Main part
	
	sort(wishes, wishes+n);
	sort(apps, apps+m);
	
	int matches = 0;
	int curapp = 0;
	int curwish = 0;

	while((curwish < n) && (curapp < m)){
		if(abs(wishes[curwish]-apps[curapp]) <= k){
			matches++;
			curapp++;
			curwish++;
		} else if(wishes[curwish] < apps[curapp]){
			curwish++;

		} else if(wishes[curwish] > apps[curapp]){
			curapp++;
		}
	}
	

	//Write out
	cout << matches << "\n";
		
	//Return
	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