Score: $200$ points
The restaurant AtCoder serves the following five dishes:
Here, the time to serve a dish is the time between when an order is placed and when the dish is delivered.
This restaurant has the following rules on orders:
E869120 arrives at this restaurant at time $0$. He will order all five dishes. Find the earliest possible time for the last dish to be delivered.
Here, he can order the dishes in any order he likes, and he can place an order already at time $0$.
Input is given from Standard Input in the following format:
$A$ $B$ $C$ $D$ $E$
Print the earliest possible time for the last dish to be delivered, as an integer.
29 20 7 35 120
215
If we decide to order the dishes in the order ABC Don, ARC Curry, AGC Pasta, ATC Hanbagu, APC Ramen, the earliest possible time for each order is as follows:
There is no way to order the dishes in which the last dish will be delivered earlier than this.
101 86 119 108 57
481
If we decide to order the dishes in the order AGC Pasta, ARC Curry, ATC Hanbagu, APC Ramen, ABC Don, the earliest possible time for each order is as follows:
There is no way to order the dishes in which the last dish will be delivered earlier than this.
123 123 123 123 123
643
This is the largest valid case.