skokovi resena

#include <iostream>
#include <bits/stdc++.h>
#include <vector>

using namespace std;

int main()
{
    int m, w, r, n;
    cin >> m;
    int mw[m];
    for (int i=0; i<m; i++){
        cin >> mw[i];
    }
    sort(mw, mw+m);
    cin >> w;
    int ww[w];
    for (int i=0; i<w; i++){
        cin >> ww[i];
    }
    sort(ww, ww+w);
    cin >> r >> n;
    vector<int> kay[m];
    //memset(kay, false, w*m);
    for (int i=0; i<m; i++){
        int sum = 0;
        for (int j=0; j<w; j++){
            if (abs(mw[i] - ww[j]) <= r){
                kay[i].push_back(1);
                sum++;
            }
            else{
                kay[i].push_back(0);
            }
            cout << kay[i][j] << " ";
        }
        kay[i].push_back(sum);
        cout << kay[i][w];
        cout << endl;
    }
    for (int i=0; i<m; i++){
        if (kay[i][w] < n){
            cout << i;
            return 0;
        }
    }
    return 0;
}