Problem:
Score : 100 points

Problem Statement

There are N flowers arranged in a row.
For each i (1 \leq i \leq N), the height and the beauty of the i-th flower from the left is h_i and a_i, respectively.
Here, h_1, h_2, \ldots, h_N are all distinct.

Taro is pulling out some flowers so that the following condition is met:

The heights of the remaining flowers are monotonically increasing from left to right.

Find the maximum possible sum of the beauties of the remaining flowers.

Constraints

All values in input are integers.

1 \leq N \leq 2 × 10^5

1 \leq h_i \leq N

h_1, h_2, \ldots, h_N are all distinct.

1 \leq a_i \leq 10^9

Input

Input is given from Standard Input in the following format:

N
h_1 h_2 \ldots h_N
a_1 a_2 \ldots a_N

Output

Print the maximum possible sum of the beauties of the remaining flowers.

Sample Input 1

4
3 1 4 2
10 20 30 40

Sample Output 1

60

We should keep the second and fourth flowers from the left.
Then, the heights would be 1, 2 from left to right, which is monotonically increasing, and the sum of the beauties would be 20 + 40 = 60.

Sample Input 2

1
1
10

Sample Output 2

10

The condition is met already at the beginning.

Sample Input 3

5
1 2 3 4 5
1000000000 1000000000 1000000000 1000000000 1000000000

Sample Output 3

5000000000

The answer may not fit into a 32-bit integer type.

Sample Input 4

9
4 2 5 8 3 6 1 7 9
6 8 8 4 6 3 5 7 5

Sample Output 4

31

We should keep the second, third, sixth, eighth and ninth flowers from the left.

Solution in Ruby (2.3.3) (judge verdict: Accepted)

# 参考・参照サイト https://ikatakos.com/pot/programming_algorithm/contest_history/atcoder/2019/0106_educational_dp_2
# 学習を目的として上記サイトを参考に、セグメント木の箇所をBinary Index Treeに変更し、動作確認をさせていただきました。

# メモ：高さの低い順に美しさの総和の最大値が確定される


# require 'pry'
N = gets.to_i
ind = -1
height = gets.split.map do |high|
  ind += 1
  t = high.to_i
  [t, ind]
end

beauty = gets.split.map(&:to_i)

@data = Array.new(N+1, 0)

def update(k, x)
  while k <= N
    if @data[k] < x
      @data[k] = x
    else
      break
    end
    k += k & -k
  end
end


def get_max(k)
  ret = @data[k]
  while k > 0
    ret = @data[k] if ret < @data[k]
  k -= k & -k
  end
  return ret
end

# 高さの昇順でソート
srt = height.sort_by{|x|x[0]}

srt.each do |h, i|
  # 左端〜i番目間の最大値(高さh未満)
  # →高さが低い順なので、現在の高さより大きい花の美しさは反映されていない
  # BITは1origin(BITは先頭の要素を使用しない為)
  max_i = get_max(i+1)
  update(i+1 , max_i + beauty[i])
end

# 全区間における最大値が解答
puts get_max(N)