Minimum Elevator Rides

Each person must ride exactly once. Any group can share a ride if the sum of its weights is no greater than capacity. People may be regrouped freely; their input order does not matter. Minimize the number of rides.

Implement elevator_rides(weights, capacity).

Input

weights: The weight of each person.

capacity: The maximum combined weight in a ride.

Output

Return the minimum number of rides.

सीमाएँ

1 ≤ people ≤ 20. 1 ≤ capacity ≤ 1,000,000,000. Every weight is between 1 and capacity.

उदाहरण

इनपुट:
weights = [3, 4, 5]
capacity = 7

अपेक्षित आउटपुट:
expected = 2

इनपुट:
std::vector<long long> weights = {3, 4, 5};
long long capacity = 7;

अपेक्षित आउटपुट:
long long expected = 2;

इनपुट:
long[] weights = new long[] {3, 4, 5};
long capacity = 7;

अपेक्षित आउटपुट:
long expected = 2;

इनपुट:
weights = [2, 2, 2]
capacity = 6

अपेक्षित आउटपुट:
expected = 1

इनपुट:
std::vector<long long> weights = {2, 2, 2};
long long capacity = 6;

अपेक्षित आउटपुट:
long long expected = 1;

इनपुट:
long[] weights = new long[] {2, 2, 2};
long capacity = 6;

अपेक्षित आउटपुट:
long expected = 1;

संदर्भ

यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।

• Elevator Rides — 1653