#include<stdlib.h>
#include<stdio.h>
void firstFit(int block[],int b,int proc[],int n){
	int alloc[n];
	for(int i=0;i<n;i++)
		alloc[i]=-1;
	
	for(int i=0;i<n;i++){
		for(int j=0;j<b;j++){
			if(block[j]>=proc[i]){
				alloc[i]=j;
				block[j]=block[j]-proc[i];
				j--;
				break;
			}
			
		}
	}
	
	printf("\nP_No.\tP_Size\tBlock_No.");
	for(int i=0;i<n;i++){
		printf("\nP%d\t%d",i,proc[i]);
		if(alloc[i]!=-1)
			printf("\t%d",alloc[i]);
		else
			printf("\tNot Allocated");
	}
}
void bestFit(int block[],int b,int proc[],int n){
	int alloc[n];
	for(int i=0;i<n;i++)
		alloc[i]=-1;
		
	int bst;
	for(int i=0;i<n;i++){
		bst=-1;
		for(int j=0;j<b;j++){
			if(block[j]>=proc[i]){
				if(bst==-1 || block[bst]>block[j])
					bst=j;
			}
		}
		if(bst!=-1){
			alloc[i]=bst;
			block[bst]-=proc[i];
		}
	}
	
	printf("\nP_No.\tP_Size\tBlock_No.");
	for(int i=0;i<n;i++){
		printf("\nP%d\t%d",i,proc[i]);
		if(alloc[i]!=-1)
			printf("\t%d",alloc[i]);
		else
			printf("\tNot Allocated");
	}

}
void worstFit(int block[],int b,int proc[],int n){
	int alloc[n];
	for(int i=0;i<n;i++)
		alloc[i]=-1;
	
	int wst;
	for(int i=0;i<n;i++){
		wst=-1;
		for(int j=0;j<b;j++){
			if(block[j]>=proc[i]){
				if(wst==-1 || block[wst]<block[j])
					wst=j;
			}
		}
		if(wst!=-1){
			alloc[i]=wst;
			block[wst]-=proc[i];
		}
	}
	
	printf("\nP_No.\tP_Size\tBlock_No.");
	for(int i=0;i<n;i++){
		printf("\nP%d\t%d",i,proc[i]);
		if(alloc[i]!=-1)
			printf("\t%d",alloc[i]);
		else
			printf("\tNot Allocated");
	}
}

void main(){
	int i,b,n,choice;
	while(1){
		printf("\nEnter your choice : \n1.First Fit\n2.Best Fit\n3.Worst Fit\n");
		scanf("%d",&choice);
		printf("Enter the number of blocks : ");scanf("%d",&b);int block[b];
		printf("Enter the  block values : \n");
		for(i=0;i<b;i++){
			printf("B%d :",i);scanf("%d",&block[i]);
		}
		printf("Enter the number of processes : ");scanf("%d",&n);int proc[n];
		printf("Enter the  Process values : \n");
		for(i=0;i<n;i++){
			printf("P%d :",i);scanf("%d",&proc[i]);
		}

		switch(choice){
			case 1 : firstFit(block,b,proc,n);
				break;
			case 2 : bestFit(block,b,proc,n);break;
			case 3 : worstFit(block,b,proc,n);break;
			case 4:exit(0);
			}
	}
}