jobs[p]
]
cout<
time<
current_hour=current_hour+(jobs[p].need_time+current_minute)/60;
current_minute=(jobs[p].need_time+current_minute)%60;
jobs[p].visited=1;
total_time+=jobs[p].wait_time;
}
cout<
}
//優先數調度算法
void privilege()
{
int i,j,p;
int current_hour;
int current_minute;
int current_privilege;
int total_time=0;
//輸出作業流
cout<
cout<
cout<<"------------------------------------------------------------------------"<
cout.setf(2);
cout<
current_hour=jobs[quantity-1].reach_hour;
current_minute=jobs[quantity-1].reach_minite;
for(i=0;i
current_privilege=30000;
for(j=0;j
if((jobs[j].visited==0)&&(jobs[j].privilege
p=j;
current_privilege=jobs[j].privilege;
[1] [2] [3] [4] [5] [6] [7] [8] [9]
From:http://tw.wingwit.com/Article/program/czxt/201311/24014.html