Profitable crime schemes
Your task
A group of members can commit crimes. Crime i requires group[i] members and yields profit[i]. A scheme is a subset of crimes; it is profitable if its total profit is at least minProfit and it uses at most n members total (each member can be used by at most one crime, and a chosen crime consumes its full headcount). Return the number of profitable schemes modulo 1000000007. n and minProfit are between 0 and 100, and there are at most 100 crimes.
Examples
profitable_schemes(n: int, minProfit: int, group: list[int], profit: list[int]) -> intExample 1
Input
profitable_schemes(5, 3, [2, 2], [2, 3])Output
2