先来先服务 时间片 优先级 等操作系统设计算法原码

  #include<stdio.h>     
  #include<string.h>     
  #include<iostream>   
  using namespace std;        
  const   int   MAXPCB=10;   //定义最大进程数     
  const   int   cputime=40;
  //定义进程结构体     
  typedef   struct   node{     
  char   name[20];     
  int    status;     
  int    time;     
  int    privilege;     
  int    finished;     
  int    wait_time;  
   /*后添加部分*/
   int taskruntimesum;//任务需要运行多少时间
int taskruntime;//cpu分给任务每次运行时间
int taskruntimed;//任务已运行时间
int taskstep;//任务运行的次数
int tasksteped;//任务已运行的次数
int taskaddtimes;//每次运行时间的和
bool taskfinished;//任务完成已完成, 默认为false
  }pcb;         
  pcb   pcbs[MAXPCB];     
  int   quantity;         
  //初始化函数     
  void   initial()
  {     
      int   i;     
      for(i=0;i<MAXPCB;i++)

      {     
          strcpy(pcbs[i].name,"");     
          pcbs[i].status=0;     
          pcbs[i].time=0;     
          pcbs[i].privilege=0; 
          pcbs[i].finished=0;     
          pcbs[i].wait_time=0;
   /*后添加部分*/
  pcbs[i].taskruntimesum=0;
  pcbs[i].taskruntime=0;
  pcbs[i].taskruntimed=0;
  pcbs[i].taskstep=0;
  pcbs[i].tasksteped=0;
  pcbs[i].taskaddtimes=0;
  pcbs[i].taskfinished=false;
  
      }     
      quantity=0;     
  }         
  //读数据函数     
  int   readData()
  {     
      FILE   *fp;     
      char   fname[20];     
      int   i;
      cout<<"请输入进程流文件名:";     
      cin>>fname;     
      if((fp=fopen(fname,"r"))==NULL)
      {     
            cout<<"错误,文件打不开,请检查文件名"<<endl;