//	Round Robin
#include<iostream.h>
#include<conio.h>

struct
{
	int p,bt,at,st,ft,tat,wt;
}pro[20],temp[20],tmp;
int n,ts,order[20],k=0;
void rndrbn();
void sortat();
void main()
{
	clrscr();
	cout<<"\t\t\tRound Robin Scheduling\n";
	cout<<"-------------------------------------------------------\n";
	cout<<"\nEnter the no. of Process:";
	cin>>n;
	cout<<"\nEnter the Time Slice:\n";
	cin>>ts;
	for(int i=0;i<n;i++)
	{
		cout<<"\n\nEnter the Burst Time of Process "<<i+1<<":\n";
		cin>>pro[i].bt;
		pro[i].p=i+1;
		cout<<"Enter the Arrival Time of Process "<<i+1<<":\n";
		cin>>pro[i].at;
		temp[i]=pro[i];
	}
	rndrbn();
	cout<<"\nTheSequence of Process Execution is \n";
	for(i=0;i<k;i++)
		cout<<order[i]<<"  ";
	cout<<"\n\n\t\t\t..ANY KEY TO EXIT..";
	getch();
}
void rndrbn()
{
	sortat();
	int x=0,count=0,i=0,flag[20];
	for(int h=0;h<n;h++)
		flag[h]=0;
	while(count!=n)
	{
		if(temp[i].at<=x)
		{
			if(temp[i].bt!=0)
			{
				if(temp[i].bt<=ts)
				{
					if(flag[i]!=1)
					{
						temp[i].st=x;
						flag[i]=1;
					}
					x+=temp[i].bt;
					temp[i].bt=0;
					temp[i].ft=x;
					temp[i].tat=temp[i].ft-temp[i].at;
					order[k]=temp[i].p;k++;
					count++;
				}
				else
				{
					if(flag[i]!=1)
					{
						temp[i].st=x;
						flag[i]=1;
					}
					temp[i].bt-=ts;
//					temp[i].tat+=st-ts;
					x+=ts;
					order[k]=temp[i].p;k++;
				}

			}
		}i=(i+1)%n;

	}
	cout<<"Process\t|\tBT\t|\tAT\t|\tTAT\t|\t|ft\n";
	cout<<"-----------------------------------------------------------------------------------------\n";
	for(h=0;h<n;h++)
	for(int j=0;j<n;j++)
		if(pro[j].p==temp[h].p)
			temp[h].bt=pro[j].bt;
	for(h=0;h<n;h++)
		cout<<" P"<<temp[h].p<<"\t|\t"<<temp[h].bt<<"\t|\t"<<temp[h].at<<"\t|\t"<<temp[h].tat<<"\t|\t"<<temp[h].ft<<"\n";

}
void sortat()
{
	for(int i=0;i<n-1;i++)
	for(int	j=i;j<n;j++)
		if(temp[i].at>temp[j].at)
		{
		     tmp=temp[i];
		     temp[i]=temp[j];
		     temp[j]=tmp;
		}
}