Lift Problem

CodeChefOpen on judge ↗

There are _n_ people in an office who want to get on lift to get to their respective floors. There are _n_ lifts available and all the people will get in the lift at the same time. One lift may have two people at most and additionally, the total weight in the lift should not exceed _x_. You are given the weight of each person (_w1_, _w2_, ..., _wn_), find the minimum number of lifts that will b

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