AMC 10 · 2008 · #3

Grade 5 arithmetic
optimization extremal-construction ↑ Prerequisites: multi-digit-arithmetic
📏 Short solution 💡 1 insight
📘 View easy version →
Problem
A team of players each earns at least a fixed minimum, and the whole payroll has a cap. Find the largest amount one single player could earn.

Pick an answer.

(A)
270,000
(B)
385,000
(C)
400,000
(D)
430,000
(E)
700,000
How to solve
Strategy Extreme Principle

The $700,000 cap is shared among all 21 players. To hand one player as much as possible, push everyone else to the smallest amount the rules allow. Once the other 20 sit at the floor, whatever is left of the cap belongs to the last player.

1STEP 1

Push the others to the minimum

One share is the cap minus everyone else's.

one player = 700,000 - (salaries of the other 20)
2STEP 2

Cost of the other 20 players

Pushing the others to the floor costs 300,000.

20 × 15,000 = 300,000
3STEP 3

Whatever is left goes to one player

What is left is 400,000, choice (E).

700,000 - 300,000 = 400,000
Answer
400,000
Check the total: one player at 400,000 plus twenty players at 15,000 gives 400,000 + 300,000 = 700,000, exactly the cap and not over it. Every salary is at least 15,000, so all rules hold. Choice (E) 700,000 fails because it leaves nothing for the other 20 players, who still each need $15,000.
💡Key takeaway

When a total is capped, make one share the biggest by shrinking every other share to its minimum.

  • Push the others to the minimum
  • Cost of the other 20 players
  • Whatever is left goes to one player