#748 · #879 · Profitable Schemes(盈利计划)

There are n members available. Crime i needs group[i] members and yields profit[i]. Choose a subset of crimes whose total members is at most n and whose total profit is at least minProfit. Return the number of such schemes modulo 1e9+7. Constraints: 1 <= n <= 100, 0 <= minProfit <= 100, 1 <= group.length <= 100, 0 <= group[i] <= 100, 0 <= profit[i] <= 100.