{"raw_statement":[{"iden":"problem statement","content":"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.\nTaro is pulling out some flowers so that the following condition is met:\n\n*   The heights of the remaining flowers are monotonically increasing from left to right.\n\nFind the maximum possible sum of the beauties of the remaining flowers."},{"iden":"constraints","content":"*   All values in input are integers.\n*   $1 \\leq N \\leq 2 × 10^5$\n*   $1 \\leq h_i \\leq N$\n*   $h_1, h_2, \\ldots, h_N$ are all distinct.\n*   $1 \\leq a_i \\leq 10^9$"},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$h_1$ $h_2$ $\\ldots$ $h_N$\n$a_1$ $a_2$ $\\ldots$ $a_N$"},{"iden":"sample input 1","content":"4\n3 1 4 2\n10 20 30 40"},{"iden":"sample output 1","content":"60\n\nWe 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$."},{"iden":"sample input 2","content":"1\n1\n10"},{"iden":"sample output 2","content":"10\n\nThe condition is met already at the beginning."},{"iden":"sample input 3","content":"5\n1 2 3 4 5\n1000000000 1000000000 1000000000 1000000000 1000000000"},{"iden":"sample output 3","content":"5000000000\n\nThe answer may not fit into a 32-bit integer type."},{"iden":"sample input 4","content":"9\n4 2 5 8 3 6 1 7 9\n6 8 8 4 6 3 5 7 5"},{"iden":"sample output 4","content":"31\n\nWe should keep the second, third, sixth, eighth and ninth flowers from the left."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}