Leetcode 879. Profitable Schemes

Count how many subsets of crimes use at most n members while achieving total profit at least minProfit; this is a 0/1 knapsack-style counting problem solved with dynamic programming over members and profit (profit dimension can be capped at minProfit) with results modulo 1e9+7.