Bin Packing problem description: Given an array of numbers, goal is to group them into minimum possible # of bins, but each bins items should not go above fixed bin capacity of 100. Let us assume that array contents are already in sorted order.

However, in this lab, we are ONLY validating a possible solution - so, we need to get an array of numbers in one line, another set of numbers in the next line to get the bin assignments for each number & check whether it is a valid solution (we are NOT checking whether it is the best solution though - that is lot harder - come to Dr.Jeys office hours if you want to discuss about it!). Here are a few sample inputs & outputs:

2 5 11 32 45 78 95 99 1 2 3 3 3 2 1 0 Valid

C++ PLEASE!