点击前往试题目录:https://blog.csdn.net/best335/article/details/99550556
考点:基础排序
#include<iostream>
using namespace std;
int main(){
int N,M;
cin>>N>>M;
int windows[11][5];//number x1,y1,x2,y2
for(int i=N-1;i>-1;--i){
windows[i][0]=N-i;
cin>>windows[i][1]>>windows[i][2]>>windows[i][3]>>windows[i][4];
}
for(int i=0,x,y,j=0;i<M;++i){
cin>>x>>y;
for(j=0;j<N;++j){
if(x>=windows[j][1]&&x<=windows[j][3]&&y>=windows[j][2]&&y<=windows[j][4]){
cout<<windows[j][0]<<endl;
if(j==0) break;
for(int k=0;k<5;++k) windows[N][k]=windows[j][k];
for(int k=j,xk=j-1;k>0;--k,--xk){
for(int l=0;l<5;++l)
windows[k][l]=windows[xk][l];
}
for(int k=0;k<5;++k)
windows[0][k]=windows[N][k];
break;
}
}
if(j==N)
cout<<"IGNORED"<<endl;
}
return 0;
}