Apartments

#include <algorithm>
#include <vector>


struct BinarySearch{
  std::vector<int> vec;
  int n;
  BinarySearch(int n, int k): vec(n),n(n){}

  int search(int x, int i, int j){ //i=0;j=n-1
    while(i<=j){
      int mid = i + (j - i) / 2;

      if (vec[mid] == x){
        return mid;
      } else if (vec[mid] > x) {
        j = mid-1;
      } else if (vec[mid] < x) {
        i = mid+1;
      }
    }

    return -1;
  }
};



#include <iostream>
int main(){
  int n, m, k;
  std::cin >> n >> m >> k;
  std::vector<int> desired(n);
  for (int i = 0; i<n; ++i){
    std::cin >> desired[i];
  }
  BinarySearch bsActual(m, k);
  for (int i = 0; i<m; ++i){
    std::cin >> bsActual.vec[i];
  }

  std::sort(bsActual.vec.begin(), bsActual.vec.end());
  std::sort(desired.begin(), desired.end());
  
  int d = 0;
  int a = 0;
  int numFound = 0;
  
  while(d<n && a<m){
    int found = 0;
    for (int t=desired[d]-k; t<=desired[d]+k; ++t){
      found = bsActual.search(t, a, m-1);
      if (found!=-1) {++numFound;break;}
    }
    if (found!=-1) a=found+1;
    ++d;
  }
  std::cout << numFound << "\n";
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: TIME LIMIT EXCEEDED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED