20分求助 #1 3AC

#include<bits/stdc++.h>
#define int long long
using namespace std;
int t;

struct node
{
	int num;
	int st;
	int nt;
	int u;
	friend bool operator < (const node x,const node y)
	{
		if(x.u != y.u)
		return x.u < y.u;
		else
		return x.st > y.st;
	}
};

node x;

priority_queue<node> q;

signed main()
{
	cin>>x.num >>x.st >> x.nt >> x.u;
//	cout<<x.num<<" "<<x.st << " "<<x.u<<"\n";
	
	q.push(x);
	t = x.st;
	while(cin>>x.num>>x.st>>x.nt>>x.u)
	{
		if(q.top().nt+t <= x.st)
		{
			cout<<q.top().num<<" "<<q.top().nt+t<<endl;
			t +=q.top().nt;
			q.pop();
		}
		
		if(!q.empty())
		{
			node y =q.top();
			q.pop();
			y.nt =y.nt - x.st + t;
			y.nt = max(0LL , y.nt);
			q.push(y);
		}
		
//		cout<<"time:"<<t;
		q.push(x);
		t = x.st;
//		cout<<"->"<<t<<endl;
	}
	
	while(!q.empty())
	{
		node y = q.top();
//		cout<<"time:"<<t;
		t+=y.nt;
//		cout<<"->"<<t<<endl;
		cout<<y.num <<" "<<t<<"\n";
		q.pop();
	}
	
	
	return 0;
}