20分求助！！！

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
struct plant{
    int hei,left,right,num;
}a[1005];
int n,pos,posd,ii=1,i=1,book[1005],book2[1005];
bool cmp(plant b,plant c){
    return b.hei>c.hei;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].hei>>a[i].left>>a[i].right;
        a[i].num=i;
    } 
    memset(book,0,sizeof(int));
    memset(book2,0,sizeof(int));
    sort(a+1,a+n+1,cmp);
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            pos=a[1].left;
            posd=a[1].right;
        if(pos>a[i].left && pos<a[i].right){
            cout<<a[i].num<<" ";
            book[pos]=1;
        }   
        if(posd>a[i].left && posd<a[i].right){
             cout<<a[i].num<<endl;
             book2[posd]=1;
        }
        if(i==n){
            if(book[pos]==0) cout<<0<<" ";
            if(book2[pos]==0) cout<<0<<endl;
        }
        }
    }
    return 0;
}