编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。

　　“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。

　　静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。

　　动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如

：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，等等

-Write and debug a simulation of the process scheduler, using the "highest priority number priority" scheduling process scheduling algorithm to five.

The "highest priority number first" scheduling algorithm the basic idea is to CPU allocated to the highest-priority ready queue in the process.

Static priority number is determined when creating the process, and in the whole process will not change during the operation.

Dynamic priority number refers to the process of creating a process priority number can be given an initial value, and can modify the priority number according to certain principles. Example

: In the process, get a CPU after its reduction in the number one priority. Or, the process of waiting time exceeds a certain time limit, increase the number of its priority value, and so on