Hello everyone, Can you help me with this problem please:

A customer has a menu which has 100 distinct items and he only knows 6 shops.

Let's assume that every shop has all items, and each Item_i has shipping cost and price.

Every shop has an offer, It says if your bill >= X, you will have a discount of Y%.

You have to help the customer to buy all items with minimal total cost.

Please notice that every shop has his own shipping cost and price for every item and discount only on total bill price (shipping cost not included) but the total final cost include the shipping cost of chosen items.

Brute force solution works in 6^100 which is too slow, So any ideas ?