codeforces 987C. Three displays

C. Three displays

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 $n$ displays placed along a road, and the $i$-th of them can display a text with font size $s_i$ only. Maria Stepanovna wants to rent such three displays with indices $i<j<k$ that the font size increases if you move along the road in a particular direction. Namely, the condition $s_i<s_j<s_k$ should be held.

The rent cost is for the $i$-th display is $c_i$. Please determine the smallest cost Maria Stepanovna should pay.

Input

The first line contains a single integer $n$ ($3\le n\le 3000$) — the number of displays.

The second line contains $n$ integers $s_1,s_2,\dots ,s_n$ ($1\le s_i\le {10}^9$) — the font sizes on the displays in the order they stand along the road.

The third line contains $n$ integers $c_1,c_2,\dots ,c_n$ ($1\le c_i\le {10}^8$) — 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<k$ such that $s_i<s_j<s_k$.

Examples

input

Copy

5
2 4 5 4 10
40 30 20 10 40

output

Copy

90

input

Copy

3
100 101 100
2 4 5

output

Copy

-1

input

Copy

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

output

Copy

33

Note

In the first example you can, for example, choose displays $1$, $4$ and $5$, because $s_1<s_4<s_5$ ($2<4<10$), and the rent cost is $40+10+40=90$.

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

题意：给出两个权值序列，求当si<sj<sk成立时，ci+cj+ck最小

分析：暴力显然不行的，不过可以在这个基础上优化

我们可以枚举中间的点J向两边扩散，这样的话就可以省去一维了。

然后就是注意爆int

#include<iostream>
#include<string>
#include<cstring>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include<set>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<cmath>
#include<stack>
#include<iomanip>
#include<functional>
#include <iomanip>
#include<bitset>
using namespace std;
typedef long long LL;
typedef unsigned long long ull;
const int maxn = (int)1e5 + 100;
const int BN = 30;
const int inf = 0x3f3f3f3f;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int mod = 1000000007;
const double eps = 1e-10;
const double PI = acos(-1);
struct nodes {
	LL s, c;
}dis[3333];
int main() {
	int n;
	while (~scanf("%d", &n)) {
		for (int i = 0; i < n; i++)
			scanf("%lld", &dis[i].s);
		for (int i = 0; i < n; i++)
			scanf("%lld", &dis[i].c);
		LL ans = INF;
		for (int i = 1; i < n - 1; i++) {
			LL tmp1 = INF, tmp2 = INF;
			for (int j = 0; j < i; j++) {
				if (dis[i].s > dis[j].s)
					tmp1 = min(tmp1, dis[j].c);
			}
			for (int j = i + 1; j < n; j++) {
				if (dis[i].s < dis[j].s)
					tmp2 = min(tmp2, dis[j].c);
			}
			if (tmp1 == INF || tmp2 == INF) continue;
			ans = min(ans, tmp1 + tmp2 + dis[i].c);
		}
		if (ans == INF) ans = -1;
		printf("%lld\n", ans);
	}
	return 0;
}