← All problemsSign in

Wire Cutting

There are $w$ wires of different lengths. You are required to cut the wire such that the longest piece of resulting pieces obtained after cutting has a frequency of at least $p$. ### Input - The first line of input consists of two integers $w$ and $p$. - Then, the second line consists of $w$ **double values** separated by a space – the lengths of each wire. ### Output For each testcase, output i

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