First Come First Serve (FCFS) Program

First Come First Serve (FCFS) Program:

#include<stdio.h>
int n,bt[10],w[10],at[10],t[10],a=0;
void main()
{
  int x;
  printf("Enter no of process\n");
  scanf("%d",&n);
  printf("Enter burst time\n");
  for(x=0;x<=n-1;x++)
  {
    scanf("%d",&bt[x]);
  }
  printf("Enter arrival time\n");
  fcfs();
}

void fcfs()
{
  int x;
  float wt=0,tt=0;
  for(x=0;x<=n-1;x++)
  {
    scanf("%d",&at[x]);
  }
  for(x=1;x<=n;x++)
  {
    w[x]=bt[x-1]-at[x];
    t[x]=bt[x]+w[x];
    bt[x]=bt[x] + bt[x-1];
  }
  printf("Waiting\tArrival\n");
  for(x=0;x<=n-1;x++)
  {
    printf("%d\t\t%d\n",w[x],t[x]);
    wt+=w[x];
    tt+=t[x];
  }
  printf("Average Waiting Time = %f\n",wt/n);
  printf("Average Turn_Around Time = %f\n",tt/n);
}