Smol Soldiers
CodeChefOpen on judge ↗
A Soldier $I$ is defined by his height and weight as [height, weight]. Smol Shreya wants to find no. of Smol soldiers in a given army. Given an array for the army, return the no. of Smol soldiers. A smol soldier is defined as a soldier $I$ for which there exists a soldier $J$ with $height[i] < height[j]$ and $weight[i] < weight[j]$ ### Input - The first line of input will contain a single integ
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.
Sign in to chat with the tutor and save your progress.
Sign in to start