For finding the two set for each delivery boy , using the subset divison , divide the order in two sets , find out their maximum ,
subtract it from the sum of 2* all elements in set - maximum ; and findout which set consumes more time
and for all those possible combination 2^n check the minimum of it.