BestFit

#include<stdio.h>
//#include<conio.h>
int p[20],m[20];
void sort(int a[],int n){
    int i,j,temp;
    for(i=0;i<n;i++)
    for(j=0;j<i;j++)
    if(a[j]>a[j+1]){
        temp=a[j];
        a[j]=a[j+1];
        a[j+1]=temp;
    }
}
int main(){
    int np,nm,i,j;
//  clrscr();
    printf("Enter no of programs:  ");
    scanf("%d",&np);
    printf("Enter no of memory size:  ");
    scanf("%d",&nm);
    if(np>nm)
    printf("Insufficient memory !!!\n");
    else{
        printf("Enter programs\n");
        for(i=0;i<np;i++)
        scanf("%d",&p[i]);
        printf("Enter memory size\n");
        for(i=0;i<nm;i++)
        scanf("%d",&m[i]);
        sort(p,np);
        sort(m,nm);
        printf("\nSorted list for program: \n");
        for(i=0;i<np;i++)
        printf("%d\t",p[i]);
        printf("\nSorted list for memory size:\n");
        for(i=0;i<nm;i++)
        printf("%d\t",m[i]);
        printf("\nNO\tPROG\tMEMORY\n");
        for(i=0,j=0;i<np;i++,j++)
        if(p[i]<m[j])
        printf("\n%d\t%d\t%d",i+1,p[i],m[j]);
        else
        i--;
    }
//  getch();
}
/*OUTPUT:
Enter no of programs:  4
Enter no of memory size:  5
Enter programs
32
8
12
95
Enter memory size
12
40
102
13
45

Sorted list for program:
8       12      32      95
Sorted list for memory size:
12      13      40      45      102

NO      PROG    MEMORY

1       8       12
2       12      13
3       32      40
4       95      102
*/