Get Minimum Cost

Problem Statement

Get Minimum Cost Problem Description A company is choosing machine learning models to buy. There are n models available. Model i has a price cost[i] and a two-character availability string featureAvailability[i] that says which of two features, feature A and feature B, the model is suitable for. The characters of featureAvailability[i] are read as follows: "00" : the model is not suitable for either feature. "01" : the model is suitable for feature A but not for feature B. "10" : the model is suitable for feature B but not for feature A. "11" : the model is suitable for both features. A set of models is called k-capable when the number of models in the set that are suitable for feature A is at least k and the number of models in the set that are suitable for feature B is also at least k . A model that is suitable for both features counts once towards each of the two totals. For every k from 1 to n , report the minimum total price of a k-capable set of models. If no k-capable set exists