题解

#include<bits/stdc++.h>
using namespace std;
int n,l,b,x[1000001],y[1000001],j=1;
struct ak{
	int x1,y1,id;
}a[1000001];
bool cmp(ak c,ak d){
	if(c.x1>d.x1)return 1;
    if(d.x1>c.x1)return 0;
    if(c.y1<d.y1)return 1;
    if(d.y1<c.y1)return 0;
    if(c.id<d.id)return 1;
    return 0;
}
int main(){
    cin>>n>>l>>b;
    for(int i=1;i<=n;i++){
        cin>>x[i]>>y[i];
    	if(x[i]>=l&&y[i]<=b){
            j++;
        	a[j].x1=x[i];
            a[j].y1=y[i];
            a[j].id=i;
        }
    }
    sort(a+1,a+j+1,cmp);
    int p=j;
    for(int i=1;i<=p;i++){
    	if(!(a[i].id==0))cout<<a[i].id<<" ";
    }
	return 0;
}