I am not following the problem statement of the USACO Silver problem Convention. We have M buses that can house a maximum of C cows, and we must find the min of a cow’s largest waiting time.
Sorting cows by time, once cow 1 gets bus i, it’s always optimal to place cow 2 in the same bus. If it’s in a different bus j, we’ll have to wait until another cow 3 comes to fulfill the size of bus i. Then the waiting time of cow 1 will be greater. The waiting time of cow 2 will also be greater since we’ll have to wait for yet another cow 4 to fulfill the size of bus j. Had we instead put cow 2 in bus i, cow 1 would have a smaller waiting time, and cow 2’s waiting time wouldn’t even matter since it’s less than cow 1’s wait anyway.
Greedily, from what I’m understanding of the problem, we need to continue placing cows in the same bus until C cows arrive, in which case we send the bus away. However, the way I am interpreting the problem is clearly incorrect. Can you please clarify?