设计程序模拟进程的先来先服务FCFS和短作业优先SJF调度过程。假设有n个进程分别在T1, … ,Tn时刻到达系统，它们需要的服务时间分别为S1, … ,Sn。分别采用先来先服务FCFS和短作业优先SJF进程调度算法进行调度，计算每个进程的完成时间，周转时间和带权周转时间，并且统计n个进程的平均周转时间和平均带权周转时间。-Design program to simulate the process of a first-come first-served FCFS and SJF short job priority scheduling process. Suppose there are n processes at T1, ..., Tn time to reach the system, they need service hours are S1, ..., Sn. Were used to first come first serve priority FCFS and SJF short job scheduling process scheduling algorithm to calculate the completion time of each process, turnaround time and take the right turn-around time, and statistical process of n the average turnaround time and average turnaround time with the right.