AMC 8 · 2014 · #24

Grade 6 arithmeticlogic
mean-median-mode-rangeoptimization-countingbound-inequality-then-enumerate bound-inequality-then-enumerateidentify-subproblems ↑ Prerequisites: mean-median-mode-rangemulti-digit-arithmetic
📏 Long solution 💡 4 insights
Problem
On one day, 100 customers bought a total of 252 cans of soda, and every customer bought at least one can. Arrange the per-customer can counts in non-decreasing order and call them c₁ ≤ c₂ ≤ … ≤ c₁00. The median is the average of c₅0 and c₅1. What is the largest value this median can take?

Pick an answer.

(A)
2.5
(B)
3.0
(C)
3.5
(D)
4.0
(E)
4.5

AMC 8 2014 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Change Focus / Count the Complement

We want c₅0 and c₅1 to be as large as possible, but the budget of 252 cans is shared among all 100 customers. Tool #16 (Change Focus) flips the question: instead of "how large can c₅0, c₅1 be?", ask "how small can everyone else be?" — the cans we save by minimizing the rest are exactly the cans we can hand to the median pair. Tool #7 (Subproblems) splits the sorted list into three blocks — the 49 customers below the median, the median pair (c₅0, c₅1), and the 49 customers above — each handled separately. Tool #9 (Easier Problem) checks the logic on a tiny version (say 6 customers, 14 cans) before trusting it on 100.

1STEP 1

Split the sorted list into three blocks: the 49 low customers, the median pair (c₅0, c₅1), and the 49 high customers, summing to 252.

c₁ + … + c₄9_low (49) + c₅0 + c₅1_median pair + c₅2 + … + c₁00_high (49) = 252
2STEP 2

Give each of the 49 low customers the minimum 1 can, so the low block totals 49 cans and leaves the rest for the middle.

c₁ = c₂ = … = c₄9 = 1, sum = 49 × 1 = 49
3STEP 3

Subtract the low block from 252 to leave 203 cans for the median pair plus the high block (51 customers).

c₅0 + c₅1 + … + c₁00 = 252 - 49 = 203
4STEP 4

Set all high values equal to c₅1 and share 203 among 51 as evenly as possible: 203 = 50 × 4 + 3, so 50 get 4 cans and one gets 3.

203 ÷ 51 = 3 remainder 50, so 203 = 50 × 4 + 1 × 3
5STEP 5

The lone 3 must sit at c₅0 to keep the order, giving c₅0 = 3 and c₅1 = 4, so the median is 3+42\frac{3 + 4}{2}.

c₅0 = 3, c₅1 = 4, median = 3+42\frac{3 + 4}{2} = 3.5 → (C)
Answer
3.5
Sanity check: the average is 252100\frac{252}{100} = 2.52. The median can exceed the mean only when the bottom half is squashed down and the top half is leveled, which is exactly what we did. Pushing the low 49 to 1 each saved 49 × 1.52 ≈ 75 cans, which we redistributed to lift the upper 51 from their fair share of 2.52 up to nearly 4. A median of 3.5, slightly above the lifted average of 20351\frac{203}{51} ≈ 3.98 for the upper block, is consistent. Trying to push higher fails: if c₅0 ≥ 4, the upper 51 values would need to sum to at least 4 × 51 = 204 > 203.
💡Key takeaway

To make the middle of a sorted list as big as possible, squash the bottom as small as the rules allow — that frees up the most resources to lift the middle!