作业之考试n

贮存地毯边界，从后往前或从前往后搜都可以过，

#include<bits/stdc++.h>
using namespace std;
int q[10010],w[10010],e[10010],r[10010];
int m=-1,n;
int main(){
//	freopen("carpet.in","r",stdin);
//	freopen("carpet.out","w",stdout);
	scanf("%d",&n);
	for(int z=1;z<=n;++z) scanf("%d%d%d%d",&q[z],&w[z],&e[z],&r[z]);
	int x,y;
	scanf("%d%d",&x,&y);
	for(int z=1;z<=n;++z) if(q[z]<=x&&x<=q[z]+e[z]&&w[z]<=y&&y<=w[z]+r[z]) m=z;
	printf("%d",m);
}