#include<stdio.h>
#define max 25
//ff
void main()
{
    int bsize[max], psize[max], bno, pno, flags[max], allocation[max],fragm[max], i, j;

    for(i = 0; i < max; i++)
    {
        flags[i] = 0;
        allocation[i] = -1;
        fragm[i] = 1;
    }

    printf("Enter no. of blocks: ");
    scanf("%d", &bno);

    printf("\nEnter size of each block:-\n");
    for(i = 0; i < bno; i++){
        printf("Block %d: ",i);
        scanf("%d", &bsize[i]);
    }

    printf("\nEnter no. of processes: ");
    scanf("%d", &pno);

    printf("\nEnter size of each process:-\n");
    for(i = 0; i < pno; i++){
        printf("Process %d: ",i);
        scanf("%d", &psize[i]);
    }

    //Loop for all process
    for(i = 0; i < pno; i++){
        for(j = 0; j < bno; j++){

            //Detect the size of block is larger than the size of process.
            if(flags[j] == 0 && bsize[j] >= psize[i])
            {

                //Allocate the process to block
                allocation[j] = i;

                flags[j] = 1;

                //Calculating Fragment
                fragm[i] = fragm[i]+(bsize[i]-psize[i]);
                break;
            }
        }
    }

    //display allocation details


    printf("\nBlock no.\tBsize\t\tprocess no.\t\tPsize\t\\Fragment");
    for(i = 0; i < bno; i++)
    {
        printf("\n%d\t\t%d\t\t", i, bsize[i]);
        if(flags[i] == 1){

            printf("%d\t\t\t%d\t%d",allocation[i],psize[allocation[i]],fragm[i]);




        }
        else
            printf("Not allocated");
    }

}