rt，代码如下

#include<bits/stdc++.h>
using namespace std;
int L[10005],R[10005],high[10005];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>high[i]>>L[i]>>R[i];
	}
	for(int i=1;i<=n;i++)
	{
		int l=0,r=0;
		for(int j=1;j<=n;j++)
		{
			if(j==i) continue;
			if(L[j]<L[i]&&high[j]<high[i]) l=j;
			if(R[j]>R[i]&&high[j]<high[i]) r=j;
		}
		cout<<l<<" "<<r<<endl;
	}
	return 0;
}