RDINNER - A Romantic Dinner Outing

no tags 

Brian the Computer Science Nerd is going on a date with his girlfriend, Anatevka! His romantic location of choice is a Chinese restaurant.

At this restaurant, $N$ ($1 \leq N \leq 15$) different dishes are available, and Brian would like to order each one exactly once. The waiter will come to his table to take orders $N$ times - the $i$th time he comes will be $W_i$ ($1 \leq W_1 < W_2 < \dots < W_N \leq 10^9$) minutes after the start of the meal. He has quite a poor memory, so each time he comes by, Brian will have a chance to order exactly one new dish.

Dish $i$ takes $T_i$ ($1 \leq T_i \leq 10^9$) minutes to prepare, which means that it will generally come exactly that many minutes after being ordered, delivered by a different waiter who will not take orders. However, meals are guaranteed to arrive in the same order in which they were ordered - this means that, if meal $i$ was ordered before meal $j$, but meal $j$ is ready before meal $i$, then meal $j$ will instead arrive at the same time as meal $i$.

Now, Brian considers time spent waiting for the first meal after the start of the dinner, as well as for each subsequent meal after the previous one, to be idle time. Of course, these are the worst parts of the date, as they require actually engaging in conversation rather than consuming sustenance. In order to impress Anatevka with his optimal ordering skills, he'd like to minimize the length of the largest continuous stretch of idle time throughout the dinner.

Input

Line 1: 1 integer, $N$

Line 2: $N$ integers, $W_{1..N}$

Line 3: $N$ integers, $T_{1..N}$

Output

1 integer, the minimal length possible for the longest stretch of idle time throughout the meal, in minutes

Example

Input:
3
1 5 6
4 2 3
Output:
4
Explanation of Sample:

Brian's optimal strategy is to order dish 3, then 2, then 1. These dishes will then arrive 4, 7, and 10 minutes into the dinner, respectively. The longest stretch of idle time is then 4 minutes long.

As a further example, if Brian were to order dish 3, then 1, then 2, the last 2 dishes would both arrive 9 minutes into the dinner, with dish 2 being held up by dish 1.


hide comments
karishmabu: 2018-11-02 14:53:13

.

Last edit: 2018-11-02 14:56:55
Jacob Plachta: 2013-06-07 03:20:10

NOTE: Sorry, but an incorrect solution once again managed to pass on the previous data, so I added one more hand-made case.

Jacob Plachta: 2013-05-31 15:36:30

NOTE: The original data proved too weak, as the only submission so far (an incorrect greedy solution) passed, so I had to add an additional case and rejudge. Sorry, ||zone!


Added by:SourSpinach
Date:2013-05-30
Time limit:2s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own problem