多级反馈队列调度算法实现

#include
#include
#include
#include
#include
#include
#include
#include“process.h“
int main（）{
   int process_time[10];      //进程到达第一级队列的时间
   int p_num=10;
   for（int i=0;i       process_time[i]=i;      //假定进程从前往后一次间隔一秒到达，第一个进程到达时间为0
   }

   int queue_num=3;
   Proqueue proqueue[queue_num];                                     //运行进程的队列总数为3
   for（int i=0;i        proqueue[i].setQuePrior（i+1）;
        proqueue[i].setQueTime（pow（2i+1））;
   }
   for（int i=0;i       process[i].get_time=process[i].get_wait_time=process[i].end_time=0;
       process[i].prior=1;                                          //进程首先应进入优先级为1的队列中，故默认进程优先级为1
       //cin>>process[i].id>>process[i].run_time_num;               //输入进程id号和进程的总运行时间
   }
   int shuru;
   cout<<“please input‘1‘the program will read the data from the file ‘input.txt‘or input other number to terminate it.“<   cin>>shuru;
   if（shuru==1）{
   string line;
   ifstream openfile（“input.txt“）;
   int head=0q=0;
   while（getline（openfileline））
   {
     istringstream is（line）;
     if（head==0）{
        head=1;
        continue;
        }
        is>>process[q].id>>process[q].run_time_num;
        //cout<        q++;
    }
    openfile.close（）;
   }
   else
    return 0;
   cout<<“read data from the file successfully！“<
   for（int i=0;i      struct Pronode *pronode=new Pronode（）;
      pronode->id=process[i].id;
      proqueue[0].enqueue（pronode）;
   }

  int j=0record_time=0;                                      //记录各个进程在队列中的总运行时间
  struct Pronode *p=new Pronode（）;                            //p_num为尚未结束运行进程总数
  ofstream output（“output.txt“）;
   while（1）{
       while（proqueue[j].getLength（）>0）{
            int i;
            p=proqueue[j].dequeue（）;                          //进程块出队
            for（i=0;i                if（p->id==process[i].id）{
                    if（process[i].run_time_num-process[i].get_time<=proqueue[j].getQueTime（））{  //进程运行剩余运行总时间小于等于所在队列时间片，则进程运行完毕
                       if（record_time                         process[i].end_time=process_time[i]+process[i].run_time_num-process[i].get_time;  //                                                     ///////////////////////////////////////
                         record_time=process_time[i];}//+process[i].run_time_num-process[i].get_time;}
                       else{
                       process[i].end_time=record_time+process[i].run_time_num-process[i].get_time;
                       record_time+=process[i].run_time_num-process[i].get_time;
                       }
                       cout<                       output<