比赛题解 总结

#include<bits/stdc++.h>
#define ll long long 
using namespace std;
struct node{
	ll id,be,ti,yx;
	bool operator < (const node &a)const{
		if(yx==a.yx) return be>a.be;
		return yx<a.yx;
	}
}a;
ll lati;
priority_queue<node> q;
int main(){
	while(scanf("%lld%lld%lld%lld",&a.id,&a.be,&a.ti,&a.yx)!=EOF){
		while(q.size()&&q.top().ti+lati<=a.be){
			node b=q.top();
			q.pop();
			cout<<b.id<<" "<<lati+b.ti<<"\n";
			lati+=b.ti;
		}
		if(q.size()){
			node b=q.top();
			q.pop();
			b.ti-=a.be-lati;
			q.push(b);
		}
		q.push(a);
		lati=a.be;
	}
	while(q.size()){
		node b=q.top();
		q.pop();
		lati+=b.ti;
		cout<<b.id<<" "<<lati<<"\n";
	}
	return 0;
}