Cucumber - MarisaOJ: Marisa Online Judge

Nitori's cucumber garden has

n

$n$ cucumbers that need to be harvested. Harvesting a cucumber requires exactly one unit of time, and the

i

$i$ -th cucumber needs to be harvested before time

a_{i}

$a_i$ . Not harvesting the

i

$i$ -th cucumber will incur a loss of

b_{i}

$b_i$ . Help Nitori harvest the cucumbers in an optimal order to minimize the loss. ### Input - The first line contains two integers

n

$n$ . - The second line contains

n

$n$ integers

a_{i}

$a_i$ . - The third line contains

n

$n$ integers

b_{i}

$b_i$ . ### Output - Print an integer, the minimum loss. ### Constraints -

1 \leq n \leq 1000

$1 \leq n \leq 1000$ . -

1 \leq a_{i}, b_{i} \leq 1000

$1 \leq a_i, b_i \leq 1000$ . ### Example Input:

5132311040302015

$5 1 3 2 3 1 10 40 30 20 15$

Output:

25

$25$

Topic

Sorting

Rating

1000

Solution (0)

Solution