← All problemsSign in

Pep Bidding

CodeChefRating 833Open on judge ↗

Pep is known for his golden bids on football matches. Surprisingly, he has a rather simple strategy! Team $A$ and team $P$ are playing against each other, and each of them have $N$ players. For each $i$ from $1$ to $N$, - Pep believes that the $i$-th player on team $A$ has an attack power of $attA_i$, and a defense power of $defA_i$. - Similarly, the $i$-th player on team $P$ has an attack powe

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start