Printer Queue（打印队列）POJ3125

最新推荐文章于 2021-04-12 19:46:03 发布

tiantangrenjian

最新推荐文章于 2021-04-12 19:46:03 发布

阅读量4.8k

点赞数

CC 4.0 BY-SA版权

分类专栏：算法学习模拟算法文章标签： printing jobs integer 作业 each 数据结构

本文链接：https://blog.youkuaiyun.com/tiantangrenjian/article/details/6821630

该博客探讨了POJ3125问题，涉及打印机队列管理。当有新作业加入时，如果当前作业的优先级低于队列中其他作业，则该作业会被移到队尾。根据输入的作业数量和优先级，程序会按优先级顺序进行打印。示例展示了如何处理不同优先级的作业及其输出结果。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Printer Queue

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 2817		Accepted: 1523

Description

The only printer in the computer science students' union is experiencing an extremely heavy workload. Sometimes there are a hundred jobs in the printer queue and you may have to wait for hours to get a single page of output.

Because some jobs are more important than others, the Hacker General has invented and implemented a simple priority system for the print job queue. Now, each job is assigned a priority between 1 and 9 (with 9 being the highest priority,
and 1 being the lowest), and the printer operates as follows.