Three displays（基础DP）

It is the middle of 2018 and Maria Stepanovna, who lives outside Krasnokamensk (a town in Zabaikalsky region), wants to rent three displays to highlight an important problem.

There are nn displays placed along a road, and the ii -th of them can display a text with font size sisi only. Maria Stepanovna wants to rent such three displays with indices i<j<ki<j<k that the font size increases if you move along the road in a particular direction. Namely, the condition si<sj<sksi<sj<sk should be held.

The rent cost is for the ii -th display is cici . Please determine the smallest cost Maria Stepanovna should pay.

Input

The first line contains a single integer nn (3≤n≤30003≤n≤3000 ) — the number of displays.

The second line contains nn integers s1,s2,…,sns1,s2,…,sn (1≤si≤1091≤si≤109 ) — the font sizes on the displays in the order they stand along the road.

The third line contains nn integers c1,c2,…,cnc1,c2,…,cn (1≤ci≤1081≤ci≤108 ) — the rent costs for each display.

Output

If there are no three displays that satisfy the criteria, print -1. Otherwise print a single integer — the minimum total rent cost of three displays with indices i<j<ki<j<k such that si<sj<sksi<sj<sk .

Examples

Input

5
2 4 5 4 10
40 30 20 10 40


Output

90


Input

3
100 101 100
2 4 5


Output

-1


Input

10
1 2 3 4 5 6 7 8 9 10
10 13 11 14 15 12 13 13 18 13


Output

33


Note

In the first example you can, for example, choose displays 11 , 44 and 55 , because s1<s4<s5s1<s4<s5 (2<4<102<4<10 ), and the rent cost is 40+10+40=9040+10+40=90 .

In the second example you can't select a valid triple of indices, so the answer is -1.

DP[1][i]每个位置代表消耗

DP[2][j]这个位置与前面任意位置组合成的递增的两个的最小消耗

DP[3][i]这个位置与前面两个位置的组合成递增的三个的最小消耗

dp[2][j]=min(dp[2][j],dp[1][i]+dp[1][j]);

dp[3][j]=min(dp[3][j],dp[2][i]+dp[1][j]);

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#define pi 3.1415926
#define inf 0x3f3f3f3f
using namespace std;
const long long mod = 1e9 + 7;
#define ll long long
#define MAXN 1000005
/*struct node {
int a, b;
}t[MAXN];
bool cmp(node x, node y) {
return x.b < y.b;
}*/
int dp[4][MAXN],a[MAXN];
int main() {
int n;
while (~scanf("%d", &n)) {
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++)
scanf("%d", &dp[1][i]);
for (int i = 1; i <= n; i++)
dp[2][i] = inf;
for (int i = 3; i <= n; i++)
dp[3][i] = inf;
int ans = inf;
for (int j = 2; j <= n; j++) {
for (int i = 1; i < j; i++)
{
if (a[i] < a[j]) {
dp[2][j] = min(dp[2][j], dp[1][i] + dp[1][j]);
}
}
}
for (int j = 3; j <= n; j++) {
for (int i = 1; i < j; i++) {
if (a[i] < a[j]) {
dp[3][j] = min(dp[3][j], dp[2][i] + dp[1][j]);
}
}ans = min(ans, dp[3][j]);

}
if (ans != inf)
cout << ans << endl;
else
cout << "-1" << endl;
}
return 0;
}



©️2019 CSDN 皮肤主题: 大白 设计师: CSDN官方博客