先来先服务
#include <stdio.h>
#define n 20
struct fcfs
{
int id; //进程名
double atime; //进程到达时间
double runtime; //进程运行时间
double ftime; //进程完成时间
}f[n];
//#include"main.h"1111111111
void main()
{
int amount,i,j,l,k;
struct fcfs f[n];
printf("input a number sets of numbers:");
scanf("%d",&amount;);
for(i=0;i<amount;i++)
{
printf("请输入进程名，进程到达时间，进程运行时间:\n");
scanf("%d",&f[i].id);
scanf("%lf",&f[i].atime);
scanf("%lf",&f[i].runtime);
}
//11111111111
//2222222222#include"......".h
for(i=0;i<amount;i++) //按进程到达时间的先后排序
{ //如果两个进程同时到达，按在屏幕先输入的先运行
for(j=0;j<amount-i-1;j++)
{
if(f[j].atime>f[j+1].atime)
{
l=f[j].atime;
f[j].atime=f[j+1].atime;
f[j+1].atime=l;
k=f[j].id;
f[j].id=f[j+1].id;
f[j+1].id=k;
}
}
}
//22222222
for(i=0;i<amount;i++)
{
f[i].ftime=f[i].atime+f[i].runtime;
printf("进程%d从%.2lf开始,在%.2lf之前结束\n",f[i].id,f[i].atime,f[i].ftime);
f[i+1].atime=f[i].ftime;
}
system("pause");
}
