Profitable Schemes
You are given n members and a set of m potential crimes. Each crime i requires group[i] members and produces profit[i] profit. A member can participate in at most one crime. A 'profitable scheme' is a subset of crimes such that the total number of members required does not exceed n, and the total profit generated is at least minProfit. Return the total number of distinct profitable schemes possible. As the result can be large, return it modulo 10^9 + 7. Constraints: 1 \le n, minProfit \le 100 1 \le group.length = profit.length \le 100 0 \le group[i], profit[i] \le 100
PythonDynamic ProgrammingKnapsack Problem
00