| 源码简介： |
考虑一个这样的机房管理系统：假设我们对机器服务进行收费，如果每个用户为单位时间愿意支付的费用不同，则可以用支付费用作为优先级，优先级越高的越先得到服务，而如果两个用户优先级相同，则先到的先服务。 使用以上定义的优先队列来实现该系统。 系统提供一个菜单让管理员操作，管理员可以做如下操作：增加用户入队列，每个用户有相应的优先级（愿意付费的等级）用户出队列（为用户分配机器），出队列的用户需为优先级最高或到达最早的用户。-Consider such a room management system: Suppose we charge for services on the machine, if each user is willing to pay per unit of time different, you can use pay as a priority, the more higher priority get service first, and if two users have the same priority, the first of the first service. Defined above using the priority queue to implement the system. System allows administrators to operate a menu, the administrator can do the following: increase the user into the queue, each user has the appropriate priority (willing to pay for the class) the user out of the queue (for the user assigned the machine), a queue of users need to reach for the highest priority or the first user.
|
