ccf-201403-2 窗口
#include <iostream>
#include <algorithm>
using namespace std;
struct w{
int num,order;
int x1,y1,x2,y2;
};
int n,m,x,y;
w *a;
bool com(w a,w b){
return a.order<b.order;
}
void find(int x,int y){
int i;
for(i=n-1;i>-1;i--){
if(x>=a[i].x1&&x<=a[i].x2&&y>=a[i].y1&&y<=a[i].y2){
a[i].order=a[n-1].order+1;
cout<<a[i].num<<endl;
break;
}
}
if(i==-1){
cout<<"IGNORED"<<endl;
}
sort(a,a+n,com);
}
int main(){
cin>>n>>m;
a=new w[n];
for(int i=0;i<n;i++){
cin>>a[i].x1>>a[i].y1>>a[i].x2>>a[i].y2;
a[i].num=i+1;
a[i].order=i;
}
for(int i=0;i<m;i++){
cin>>x>>y;
find(x,y);
}
return 0;
}