样例wa，不知哪里卡掉了求条

#include<bits/stdc++.h>
using namespace std;
bool xuanzhuanjishu=1;
struct wuti{
	bool panduan;
	short int xiangxian,yuanlai;//1=y+/00,2=++,3=x+,4=+-,5=y-,6=--,7=x-,8=-+
	int heng,zong,jiazhi,zuizhongshunxu;
	double juli,xielv;
}a[300000];
short int pdxx(int o,int i)
{
	if(o==0){
		if(i==0){
			return 1;
		}else if(i>0){
			return 1;
		}else if(i<0){
			return 5;
		}
	}else if(o>0){
		if(i==0){
			return 3;
		}else if(i>0){
			return 2;
		}else if(i<0){
			return 4;
		}
	}else if(o<0){
		if(i==0){
			return 7;
		}else if(i>0){
			return 8;
		}else if(i<0){
			return 6;
		}
	}
}
bool cmo(wuti ppp,wuti qqq){
	return ppp.xiangxian<=qqq.xiangxian;
}
bool cmp(wuti ppp,wuti qqq){
	return ppp.juli<qqq.juli;
}
bool cmq(wuti ppp,wuti qqq){
	return ppp.xielv>qqq.xielv;
}
bool cmd(wuti ppp,wuti qqq){
	return ppp.yuanlai<qqq.yuanlai;
}
int main(){
	int n,xzd=1;long long l;cin>>n>>l;
	for(int i=1;i<=n;i++){
		cin>>a[i].heng>>a[i].zong>>a[i].jiazhi;
		a[i].yuanlai=i;
		a[i].xiangxian=pdxx(a[i].heng,a[i].zong);
		if(a[i].heng!=0&&a[i].zong!=0){
			a[i].xielv=a[i].zong*1.0/a[i].heng;
		}
		a[i].zuizhongshunxu=-1;
		a[i].panduan=0;
		a[i].juli=sqrt(a[i].heng*a[i].heng+a[i].zong*a[i].zong);
	}
	sort(a,a+n,cmp);
	sort(a,a+n,cmq);
	sort(a,a+n,cmo);
	for(int i=1;i<=n;i++)
	{
		cout<<a[i].xiangxian<<' '<<a[i].xielv<<' '<<a[i].juli<<'\n';
	}
	for(int cfzzz;xuanzhuanjishu==1;){
		xuanzhuanjishu=0;
		for(int i=1;i<=n;i++){
			if(a[i].juli<=l&&a[i].panduan==0){
				a[i].zuizhongshunxu=xzd;
				xzd++;
				xuanzhuanjishu=1;
				a[i].panduan=1;
				l+=a[i].jiazhi;
			}
		}
	}
	for(int i=0;i<n-1;i++)
	{
		if(a[i].xiangxian==a[i+1].xiangxian&&(a[i].xiangxian%2==1||a[i].xielv==a[i+1].xielv))
			a[i+1].zuizhongshunxu=a[i].zuizhongshunxu;
	}
	sort(a+1,a+n+1,cmd);
	for(int i=0;i<n;i++){cout<<a[i].yuanlai<<' ';}
	for(int i=0;i<n;i++){
//		cout<<a[i].zuizhongshunxu<<' ';52366
	}
}