题解：[HNOI2003]操作系统

十分简单的堆qwq

话说这两天luogu评测机是要炸了么

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
struct node{
    int id, ar, w, first;//进程号，到达时间，执行时间，优先级
    bool operator < (const node &a)const{//按照优先级从大到小，到达时间从早到晚排序
        if(first==a.first)  return ar>a.ar;
        else return first<a.first;
    }
};
node a;
long long end;
priority_queue <node> q;
int main(){
    while(scanf("%d%d%d%d",&a.id,&a.ar,&a.w,&a.first)!=EOF){
        while(!q.empty() && end+q.top().w<=a.ar){
            node b=q.top();
            q.pop();
            printf("%d %lld\n", b.id, end+b.w);
            end+=b.w;
        }
        if(!q.empty()){
            node d=q.top();
            q.pop();
            d.w=d.w-a.ar+end;
            q.push(d);
        }
        q.push(a);
        end=a.ar;
    }
    while(!q.empty()){
        node c=q.top();
        q.pop();
        end+=c.w;
        printf("%d %lld\n", c.id, end);
    }
    return 0;
}