说明：  编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对五个进程进行调度。 　　“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。 　　静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。 　　动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1。或者，进程等待的时间超过某一时限时增加其优先数的值，
(prepared a simulation and debugging process scheduling procedures, "Priority number of the highest priority" Scheduling Algorithm of five scheduling process. "Priority number of the highest priority" scheduling algorithm The basic idea is to place the CPU allocated to the priority queue to the highest Jin Cheng. Static priority is the creation of a number of processes identified, and the entire process will not change during operation. Dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number. For example : the process is a CPU after its reduction a priority. Alternatively, the process of the waiting time exceeds a certain period of time t)