不知道为啥全wa

#include<iostream>
#include<algorithm>
using namespace std;
struct node{
	int x,y;
}a[10000];
struct ed{
	int id,s,t;
};
ed b[10000];
bool cmp(ed A,ed B){
	return A.t<B.t;
}
bool cm(node A,node B){
	if(A.y!=B.y)return A.y<B.y;
	return A.x<B.x;
}
int cnt,sum,id=1;
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>b[i].id>>b[i].s>>b[i].t;
		if(b[i].id==0){
			cnt++;
			a[cnt].x=b[i].s;
			a[cnt].y=b[i].t;
		}
	}
	sort(b+1,b+n+1,cmp);
	sort(a+1,a+n+1,cm);
	for(int i=1;i<=n;i++){
		if(b[i].id==1){//公交 
			if(b[i].t-a[id].x<=45){
				if(a[id].y>=b[i].s){
					id++;
				}else{
					sum+=b[i].s;
				}
			}else{
				sum+=b[i].s;
			}
		}else{//地铁 
			sum+=b[i].s;
		}
	}
	cout<<sum;
	return 0;
}