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.

题意：给你一个大小序列，一个价值序列，让你选出3个数来要求 i  < j < k, si < sj < sk，求满足要求的序列中总价值最小是多少

思路：算是好题， 既然只选3个数， 我的思路是先 n^2选出两个数的最小价值，再跑一边选出3个数的最小价值。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <set>
#include <map>
#include <algorithm>
using namespace std;
typedef long long ll;
const int maxn = 3e3 + 5;
const int inf = 1e9 + 7;
int pre[maxn], s[maxn], c[maxn];
int main()
{
    int n;
    while(~scanf("%d", &n))
    {
        for(int i = 0; i < maxn; i++)
            pre[i] = inf;
        int ans = inf;
        for(int i = 1; i <= n; i++)
            scanf("%d", &s[i]);
        for(int i = 1; i <= n; i++)
            scanf("%d", &c[i]);
        for(int i = 2; i <= n; i++)
        {
            for(int j = 1; j < i; j++)
            {
                if(s[j] < s[i]) pre[i] = min(pre[i], c[i] + c[j]);
            }
            for(int j = 2; j < i; j++)
            {
                if(s[j] < s[i]) ans = min(ans, c[i] + pre[j]);
            }
        }
        if(ans == inf) ans = -1;
        printf("%d\n", ans);
    }
    return 0;
}