Maximum Points in an Archery Competition

Alice and Bob are opponents in an archery competition. The competition has set the following rules:

• Alice first shoots numArrows arrows and then Bob shoots numArrows arrows.
• The target has integer scoring sections ranging from 0 to 11 inclusive.
• For each section of the target with score k, where k is between 0 and 11, say Alice and Bob have shot ak and bk arrows on that section respectively:
• If ak >= bk, then Alice takes k points.
• If ak < bk, then Bob takes k points.
• If ak == bk == 0, then nobody takes k points.

You are given the integer numArrows and an integer array aliceArrows of size 12, which represents the number of arrows Alice shot on each scoring section from 0 to 11. Bob wants to maximize the total number of points he can obtain.

Return the array bobArrows which represents the number of arrows Bob shot on each scoring section from 0 to 11. The sum of the values in bobArrows should equal numArrows.

If there are multiple ways for Bob to earn the maximum total points, return any one of them.