SHORTEST JOB FIRST(SJF PRIMITIVE)

#include<stdio.h>
#include<conio.h>
void main()
{
char pname[5];
int cpu[5],rq[5],at[5];
int i ,t,min,f=0,p,j,total=0;
clrscr();
printf("\t\t\tSJF(PRIMITIVE)\n\n\n");
for(i=0;i<5;i++)
{
printf("Enter Process %d Name       :",i+1);
scanf("%s",&pname[i]);
printf("Enter Process %d CPU Time      :",i+1);
scanf("%d",&cpu[i]);
printf("Enter Process %d Arrival Time  :",i+1);
scanf("%d",&at[i]);
printf("\n\n");
}
for(i=0;i<5;i++)
{
total=total+cpu[i];
}
for(t=0;t<total;t++)
{
for(i=0;i<5;i++)
{
if(at[i]<=t)
{
rq[i]=cpu[i];
}

}
min=50;
for(j=0;j<5;j++)
{
if(rq[j]<=min && rq[j]!=0)
{
min =rq[j];
p=j;
}

}
rq[p]=rq[p]-1;
printf("\t");
printf("%d-%c-%d",t,pname[p],t+1);
printf("\t");
cpu[p]=rq[p];

}
getch();
}