TLE???全部？？？懵逼

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<queue>
using namespace std;
struct node
{
	long long num;
	long long time;
	long long length;
	long long first;
	long long end;
}s[15001];
long long cnt=1,sum,timeo=1;

struct cmp
{
	 bool operator()(node x,node y)
	{
		if(x.first!=y.first)	return x.first<y.first;
		return x.time>y.time;
	}
};
priority_queue<node,vector<node>,cmp>q;

int main()
{
	while(scanf("%lld%lld%lld%lld",&s[cnt].num,&s[cnt].time,&s[cnt].length,&s[cnt].first))cnt++;
	s[cnt].time=99999999999;s[cnt].num=99999999999; 
	while(sum<cnt-1)
	{ 	sum++;
		q.push(s[sum]);
		while(!q.empty()&&timeo+s[q.top().num].length<=s[sum+1].time)
		{
			timeo+=s[q.top().num].length;
			printf("%lld %lld\n",q.top().num,timeo);
			q.pop();
		}
		if(!q.empty())s[q.top().num].length-=s[sum+1].time-timeo;
		timeo=s[sum+1].time; 
	}
	return 0;	
}