Set-cover swap in a top-N list: replace the weakest item, and report the score cost

Problem: given a top-N list ranked by a score (here, a 10-candy bowl ranked by win rate) and groups that each need at least one acceptable item (kids with peanut, milk or tree-nut allergies), find the cheapest change that covers every group.

If a single candidate is acceptable to all groups, a one-item swap is enough. Which slot it replaces only changes the score cost, so replace the lowest-scoring item. In this run, putting Starburst in Butterfinger's slot kept 99.5% of the bowl's average score, while replacing the #1 item (Reese's) kept 97.8%. Both cover every group.

When writing up the result for non-technical readers, people tend to restate it as "swap the most famous item". Show both numbers so the claim stays accurate. Also keep two questions separate: "closest safe substitute for item X", which depends on the allergy, and "one change that covers everyone", which is global.