洛谷 P2278 [HNOI2003]操作系统

题目传送门

解题思路:

一道没啥思维含量的模拟题,但是个人感觉代码实现不简单,可能是我太弱了,花了我6个小时,3次重写.

AC代码:

#include<iostream>
#include<cstring>
#include<queue>
#include<cstdio>

using namespace std;

struct kkk {
    int id,st,re,pr;
    bool operator < (const kkk &a) const {
        if(pr == a.pr) return st > a.st;
        else return pr < a.pr;
    }
};
kkk c;
long long ti;
priority_queue<kkk> q;

int main() {
    while(scanf("%d%d%d%d",&c.id,&c.st,&c.re,&c.pr) != EOF) {
        while(!q.empty() && ti + q.top().re <= c.st) {
            kkk b = q.top();
            q.pop();
            printf("%d %lld
",b.id,ti + b.re);
            ti += b.re;
        }
        if(!q.empty()) {
            kkk d = q.top();
            q.pop();
            d.re = d.re - c.st + ti;
            q.push(d);
        }
        q.push(c);
        ti = c.st;
    }
    while(!q.empty()) {
        kkk f = q.top();
        q.pop();
        ti += f.re;
        printf("%d %lld
",f.id,ti);    
    }
    
    return 0;
}