Package Distribution

A delivery service needs to distribute a set number of packages among different routes while ensuring that no single route exceeds its maximum capacity. Given an array representing the capacities of each route and an integer representing the total number of packages to distribute, find the minimum capacity that must be set for any single route such that all packages can be delivered. The input consists of the first line containing space-separated integers (capacities) and the second line containing the total number of packages. Example: Input: 10 20 30 40 50 Output: 30