RE最后四个点玄关

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a[1008],b[1008],g[1008],k[1008];
    cin >> n;
    for(int i = 1;i <= n;i ++)
    {
        cin >> a[i] >> b[i] >> g[i] >> k[i];
    }
    int x,y;
    cin >> x >> y;
    int maxi = -1;
    for(int i = 1;i <= n;i ++)
    {
        if(x >= a[i] && x <= a[i]+g[i]-1 && y >= b[i] && y <= b[i]+k[i]-1)maxi = i;
    }
    cout << maxi;
    return 0;
}