ccf 2014-3 窗口

#include<stdio.h>
struct In{
   int up,down;
   int left,right; 
   int ans;   
}a[15];
struct Im{
    int x,y;
}b[15];
int n,m;
void sort1(int j){
    for(;j<n;j++){
        a[0]=a[j]; a[j]=a[j+1];a[j+1]=a[0];
        }
    }
int main(){
   int x,y;
    printf("enter the 'N' 'M',enter the N line,M line\n");
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++){
        scanf("%d%d%d%d",&a[i].left,&a[i].down,&a[i].right,&a[i].up);
        a[i].ans=i;
        }    
    for(int i=1;i<=m;i++)
    scanf("%d%d",&b[i].x,&b[i].y);
    int i=1;
    printf("%d %d\n",b[i].x,b[i].y);
    for(int i=1;i<=m;i++){
        int p=0;//biaoji
        for(int j=n;j>=1;j--){
            if(b[i].x>=a[j].left&&b[i].x<=a[j].right
                &&b[i].y>=a[j].down&&b[i].y<=a[j].up){
                    printf("%d\n",a[j].ans); p=1;
                    if(j!=n) sort1(j);//若用链表不需排序，只把此值连接在尾部 
                    //for(int k=n;k>=1;k--)
                     //printf("%d ",a[k].ans);
                     //printf("\n");
                    break;
                    }
            }
            if(!p) printf("INGORED\n");
        }
        return 0;
}