Please use c++ and give screen shot of full code

There are n boxes of n different items in a warehouse. Each box has a label that says the name ( mi ), total weight (w_i) in kg and the total value (v_i i) in taka of that item (i). All items are divisible. Suppose, k thieves have come to steal from the warehouse, each with a knapsack of capacity W_i. Given each thief wants to maximize his/her profit. how manv thieves will be needed to embtv the warehouse