Revise paste Untitled

#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
#include <cmath>
using namespace std;

int main() {
    int n;
    cin >> n;
    int maski[n];
    for(int i = 0; i < n; i++) {
        cin >> maski[i];
    }
    sort(maski, maski + n);

int m;
    cin >> m;
    int zenski[m];
    for(int i = 0; i < m; i++) {
        cin >> zenski[i];
    }
    sort(zenski, zenski + m);

int razlika, K;
    cin >> razlika >> K;
    int rezultat = 0;
    for(int i = 0; i + K - 1 < m; i++) {
        int najgolem = zenski[i] + razlika;
        int najmal = zenski[i + K - 1] - razlika;
        int L = 0, R = n;
        while(L < R) {
            int mid = L + (R - L) / 2;
            if(najmal <= maski[mid]) {
                R = mid;
            }
            else {
                L = mid + 1;
            }
        }
        if(L < n and maski[L] < najmal) {
            L++;
        }
        int L_tmp = L;
        L = 0;
        R = n;
        while(L < R) {
            int mid = L + (R - L) / 2;
            if(najgolem >= maski[mid]) {
                L = mid + 1;
            }
            else {
                R = mid;
            }
        }
        if(L < n and maski[L] <= najgolem) {
            L++;
        }
        
        rezultat = max(rezultat, L - L_tmp);
    }
    cout << rezultat << endl;
    return 0;
}