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.

Contraintes

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

Exemples

Entrée :
weights = [3, 4, 5]
capacity = 7

Sortie attendue :
expected = 2

Entrée :
std::vector<long long> weights = {3, 4, 5};
long long capacity = 7;

Sortie attendue :
long long expected = 2;

Entrée :
long[] weights = new long[] {3, 4, 5};
long capacity = 7;

Sortie attendue :
long expected = 2;

Entrée :
weights = [2, 2, 2]
capacity = 6

Sortie attendue :
expected = 1

Entrée :
std::vector<long long> weights = {2, 2, 2};
long long capacity = 6;

Sortie attendue :
long long expected = 1;

Entrée :
long[] weights = new long[] {2, 2, 2};
long capacity = 6;

Sortie attendue :
long expected = 1;

Références

Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.

• Elevator Rides — 1653