A group of dogs must be transported following a natural disaster. Each dog is classified as either small, medium, or large
in size. A number of vehicles with dog crates are available to transport the dogs. Each vehicle has a cost for transporting
the dogs. No vehicle can be used twice, and no vehicle must be used. Each crate is classified as either Mini, Regular,
Jumbo, or Super and hold the following arrangements of dogs:
Mini: One small dog
Regular: Two small dogs or one medium dog
Jumbo: Three small dogs, one medium + one small dog, or one large dog
Super: Four small dogs, two medium dogs, one medium + two small dogs, or one large + one small dogs
The crates don’t have to be completely full. For example, one small dog could be transported in a Regular crate. Every
dog must be transported and no crate can carry more than the specified capacity.
The objective is to assign every dog to a vehicle, such that the capacities are not exceeded, and the total cost is the
minimal possible.
Write a code in C++ using brute force enumeration method.