操作系统进程调度算法实现与优先级排序

// 111.cpp : Defines the entry point for the console application.
//


#include "stdafx.h"
#include<stdio.h>
#include<conio.h>
#include<stdlib.h>
#include<iostream>
using namespace std;
#define getpch(type) (type*)malloc(sizeof(type))            //动态分配内存空间 
struct pcb 
{ /* 定义进程控制块PCB */ 
    char ID[10]; 
    char STATE;                                             // 可以是就绪 W（WAITING）运行R（Run）阻塞B(BLOCK)状态之一
    int PRIORITY; 
    int ALLTIME; 
int number;
    int CPUTIME; 
int STARTBLOCK;
int BLOCKTIME;
int ARRIVETIME[3];                                       //进程到达时间
    struct pcb* NEXT;                                        
}*ready=NULL,*p;                                             //*p为当前pcb结构体指针，*ready为就绪队列第一个元素指针
typedef struct pcb PCB; 

void paixu()                                                        /* 建立对进程进行优先级排列函数*/ 
{
PCB *first, *second; 
int insert=0;                          

if((ready==NULL)||(((p->PRIORITY)>(ready->PRIORITY))&&(p->STATE!='W')))           //如果就绪队列为空或者当前指针指向的PCB优先级大于就绪队列里的第一个指针指向的优先级      
{ 
p->NEXT=ready;                                             //优先级最大者,插入队首
ready=p;                                                      
} 
else                                                          /* 进程比较优先级,插入适当的位置中*/ 
{ 
first=ready; 
second=first->NEXT; 
while(second!=NULL) 
{ 
if(((p->PRIORITY)>(second->PRIORITY))&&(p->STATE!='W'))                  /*若插入进程比当前进程优先数大,*/ 
{                                                                    /*插入到当前进程前面*/ 
p->NEXT=second; 
first->NEXT=p; 
second=NULL; 
insert=1;                                    //是否插入位置1
} 
else                                                 /* 插入进程优先数最低,则插入到队尾*/ 
{ 
first=first->NEXT; 
second=second->NEXT; 
} 
} 
if(insert==0)                                                 //如果插入标志位为0
first->NEXT=p;                                            //p作为最后一个元素
} 
} 
void shuru()
{