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 appcount = 0;

	REP(i,0,n){
		auto lb = lower_bound(apps, apps+m, wishes[i])-apps; 
		if(lb < m && (apps[lb]-wishes[i]) <= k){
			if(lb>0){
				apps[lb] = apps[lb-1];
			}
			else{
				apps[lb] = 0;
			}
			appcount++;
		}
		else{
			auto ub = upper_bound(apps, apps+m, wishes[i])-apps;
			if(ub < m && (wishes[i] - apps[ub]) <= k){
				if(lb>0){
					apps[lb] = apps[lb-1];
				}
				else{
					apps[lb] = 0;
				}
				appcount++;
			}

		}
	}
	

	//Write out
	cout << appcount << "\n";
		
	//Return
	return 0;

}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED