Problem Statement

Capable Models Problem Description You have n machine learning models, each described by a cost and a feature-compatibility code: cost[i] is the price tag of the i th model. featureAvailability[i] is a two-character binary string spelling out which of two features that model supports: "00": handles neither feature "01": handles feature A only, not feature B "10": handles feature B only, not feature A "11": handles both feature A and feature B Call a collection of models k-capable when it includes at least k models supporting feature A, and separately, at least k models supporting feature B (a single model can count toward both totals at once). For every k running from 1 up to n , work out the cheapest possible k-capable collection. Produce an array of n integers whose i th entry is that minimum cost for i , or -1 if no such collection can be built. Function Signature: int getMinimumCost(int cost[], string featureAvailability[]) Parameters: int cost[n] : An array of integers representin