洛谷P2278 [HNOI2003]操作系统

#include<cstdio>
#include<iostream>
#include<queue>
using namespace std;
struct data{
    int ID,Time_A,Time_B,rank;
    inline data(int ID=0,int Time_A=0,int Time_B=0,int rank=0):
    ID(ID),Time_A(Time_A),Time_B(Time_B),rank(rank){}
    inline bool operator < (const data &b)const {return rank<b.rank||(rank==b.rank&&Time_A>b.Time_A);}
}Now;
priority_queue<data> q;
int nowt;//队列中上一个结束时间 
int main()
{
    while(scanf("%d%d%d%d",&Now.ID,&Now.Time_A,&Now.Time_B,&Now.rank)!=EOF)//读入新任务 
    {
        while(!q.empty()&&nowt+q.top().Time_B<=Now.Time_A)//之前任务能做完 
        {
            nowt+=q.top().Time_B;//更新时间 
            printf("%d %d
",q.top().ID,nowt);
            q.pop();
        }
        if(!q.empty())//队列中仍有任务做不完 
        {
            data Top=q.top();
            Top.Time_B-=Now.Time_A-nowt;//将其持续时间缩短 
            q.pop();q.push(Top); 
        }
        q.push(Now);nowt=Now.Time_A;//把新任务放入队列 更新当前时间 
    }
    while(!q.empty())
    {
        data Top=q.top();q.pop();nowt+=Top.Time_B;//不断更新当前时间 
        printf("%d %d
",Top.ID,nowt);
    }
    return 0;
}