Question

You have M groups of tourists where each group wants to go on a trip. The ith group contains A[i] tourists. You need to help the tourists and provide them buses to use on the trips. You have N buses where the ith bus can accommodate at most B[i] tourists. However, there are two restrictions on the buses • Each bus can make at most one trip daily • Each bus can carry at most one group of tourists on each trip. Due to a small problem all the buses are broken and the cost of repairing the ith bus is C[i] dollars. You have a budget of D dollars to use for repairing the buses. Hence you decide to repair a subset of buses to use them on the trips. You need to schedule each group of tourists to a specific bus on a specific day Several buses can be used on the same day, but each bus can be used at most once each day It is given that each group of tourists wants to go on exactly one trip. Your task is to find the minimum number of days needed to finish all the M trips. If there is no way to make the M trips, return-1​

Answer 1

Answer:

vy0vy0u0gvupigvpigviv0ihi0vhiv00ihvvhivhipivh0pihvppibhphbiibpbiphvihpivhbippbhihbiphbi0hbpihbi0hbiphbipbhi0hbi0hb0ibh0ihbi0bh0ihbi0bhi0bhi0bhi00bhi0bhibih0bih0bhi0bhipbhi0bhi0bhi0bh0ihbi0bhi0hbi00bhi0bhi0hbihb0ib0hibhi0bhi0bhi0bhi0bhi0hbi0ibh0bih0b0hihb0ib0hihvi0hvi0hvi0bhi0b0hib0hibhi0bih0ib0hhbi0bhi0bhi0bi0hbhi0bih0b0hibhi0bih00bhi0bhibih0bih0b0ih0bhibhi0b0hibhi0b0hi0bhibih0bih0b0hib0hibhi00bhi0bhi0bhi0vhihb0i0bihbih00bhibih0ibh0b0ihibh0bh0ibhi0bhi0bh0ibh0ibhi0bh0ib0hib0hi0bhib0hibh0ibhi0bh0ibh0ibh0ibhi0bh0ibhi0bih0bh0ibhi0ihb0vih0bhi0bih0bih0bih0b0hib0hibh0ibhi0bh0ivih0v0hivih0vh0ivih0vih0bpgivihpbphipvguhivppvbhiphvipphivhviphvipvhi00vhibhi0bhi0hbi0ihv0hivpivh00vihhvi0hvi00vihvig0vih0ivh0vuhvigpvig0vig00vgvpugvugppvhivgipphivpvguvguppvgupgvuhbupvgupvgupvgpivgupvgupvugpvgupvgupvugpvpgigvipvphupbhipvpvvpgupvgupgvugv9c9uc8ycfyfcficoucofco ocu. o gv hogo hg ogh ohg vgogovuvpuvv0