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.

You can implement any meaningful bin packing algorithm. Here is a sample input & output. Note that there are multiple valid outputs.

2 5 11 32 45 78 95 99 # of bins: 4 99 97 83 88

C++ PLEASE