Bin Packing Algo - First Fit

#include<stdio.h>

int n,cap,arr[100];

int binPack();

int main()
{
    printf("Number of items: ");
    scanf("%d",&n);
    int i;
    printf("Enter the items one by one:\n");
    for(i=0;i<n;i++)
        scanf("%d",&arr[i]);
    printf("Enter bin size: ");
    scanf("%d",&cap);

    int ans=binPack();
    printf("Number of bin required: %d\n",ans);

    return 0;
}

int binPack()
{
    int i,count=1;
    int size=cap;

    for(i=0;i<n;i++)
    {
        if((size-arr[i])>0)
        {
            size=size-arr[i];
        }
        else
        {
            count++;
            size=cap;
            i--;
        }
    }

    return count;
}