Problem Statement

Your team at a leading technology company is launching a cutting-edge networking product. To generate buzz, you're running a targeted social media campaign. You have a limited marketing budget to send premium trial units to a select group of "seed" influencers on a professional network. Each potential influencer has a different cost to engage. Each user also has a market value reflecting their role and influence. Selecting a seed reaches that seed and everyone within d degrees of separation on the friendship graph (d=0 reaches only the seed itself, d=1 adds direct friends, and so on). The value of a campaign is the sum of market values of the set of distinct users reached by at least one chosen seed. A brute-force search over every subset of seeds is infeasible, so you must use the following deterministic greedy heuristic : Start with an empty seed set, total cost 0, and an empty reached set. Among the potential seeds that are not yet chosen and whose cost fits the remaining