#include<iostream>
#include<algorithm>
#include<vector>
#define num 4
#define col 3
using namespace std;
int data[num][col] = {{1,0,120},
{2,50,50},
{3,60,10},
{4,110,20}
};
void sort_fcfs(){
for(int i=0; i<num-1; i++)
for(int j=i+1; j<num; j++){
if(data[i][1] > data[j][1])
swap(data[i],data[j]);
}
}
double sum_array(double a[]){
int i = 0;
double sumf = 0;
while(i<num){
sumf = sumf + a[i];
i++;
}
return sumf/num ;
}
void Fcfs(){
sort_fcfs();
int finishtime[num];
double runovertime[num];//周转时间
double dqzztime[num];//带权周转时间
for(int i=0; i<num; i++){
if(i == 0){
finishtime[i] = data[i][1] + data[i][2];
}
else{
finishtime[i] = finishtime[i-1] + data[i][2];
}
}
for(int i=0; i<num; i++){
runovertime[i] = finishtime[i] - data[i][1];
dqzztime[i] = runovertime[i] / data[i][2];
}
printf("FCFS调度算法结果是:\n");
printf("作业名\t完成时间\t周转时间\t带权周转时间\n");
for(int i=0; i<num; i++){
printf("%d\t%d\t %.1lf\t %.1lf\n",data[i][0],finishtime[i],runovertime[i],dqzztime[i]);
}
printf("平均周转时间:%.1lf\n",sum_array(runovertime));
printf("平均带权周转时间:%.3lf\n",sum_array(dqzztime));
}
int main(){
printf("-------------------------------\n");
printf("作业名 到达时间 服务时间\n");
for(int i=0; i<num; i++){
for(int j=0; j<col; j++){
printf("%d ",data[i][j]);
}
printf("\n");
}
printf("-------------------------------\n");
Fcfs();
return 0;
}