D - Bin Packing

Let's solve an NP Hard problem today. There are $N$ objects, the $i$-th of which has size $A_i$ ($1 \le A_i \le 12$). You have several bins of size $12$. Multiple objects can be fit into the same bin if and only if the sum of their sizes is at most $12$. Find the minimum number of bins needed to fit all $N$ objects. There is a **special constraint** on the input. 1. For all non-sample files, th