This is a competition problem for last year's computer programs. The problems were sent home with the competitors so I would consider them "released".
The problem is as follows: "You want to choose the minimum number of bookshelves that is required for all your book collections, so each book collection is not divided between shelves, each shelf has the same price, and both the collections and the shelves can be different sizes To emphasize this, books can not be divided into separate shelves if they are in the same collection. There may be several collections on the same shelf.
Example input (first line: each bookshelf size, second line: each book collection size):
150 150 300 150 150
70 76 99 75 105
Expected issue (number of required bookshelves):
This was given in a comparatively beginner's competition, so I would assume that the competitors are seeking a kind of brute force solution, for. For example, find out how many different choices you can make as books are placed on the shelves) until a minimal solution is found. Is there another algorithm that can be used for that is not brute force?