Leetcode 2212. Maximum Points in an Archery Competition

Given 12 scoring zones and a limited number of arrows, choose which zones to strictly outshoot Alice in (each zone i requires aliceArrows[i]+1 arrows) to maximize the sum of their scores — a 0/1 knapsack/subset-selection problem over 12 items. Return any arrows allocation that achieves the maximum total points and sums to numArrows.