using System;

using System.Linq;

public class Program

{

    public static void Main()

    {

        int[] weight = { 345,345,175,175,175,175,470,470,470,470,345,345,175,175,200,200,200,200,300,300,400,400,350 };

        int c = 3000;

        int n = weight.Length;

        Console.Write("Total: " + weight.Sum() +

            "mm in "

            + GFG.bestFit(weight, n, c) + " pieces max");

​

    }

}

​

public static class GFG {

    // Returns number of bins

    // required using best fit

    // online algorithm

   public static int bestFit(int[] weight, int n, int c)

    {

        // Initialize result (Count of bins)

        int res = 0;

        // Create an array to store

        // remaining space in bins

        // there can be at most n bins

        int[] bin_rem = new int[n];

        // Place items one by one

        for (int i = 0; i < n; i++) {

            // Find the best bin that

            // can accommodate

            // weight[i]

            int j;

            // Initialize minimum space

            // left and index

            // of best bin

            int min = c + 1, bi = 0;

            for (j = 0; j < res; j++) {

                if (bin_rem[j] >= weight[i]

                    && bin_rem[j] - weight[i] < min) {

                    bi = j;

                    min = bin_rem[j] - weight[i];

                }

            }

            // If no bin could accommodate weight[i],

            // create a new bin

            if (min == c + 1) {

                bin_rem[res] = c - weight[i];

                res++;

            }

            // Assign the item to best bin

            else

                bin_rem[bi] -= weight[i];

        }

        return res;

    }

}