Three displays

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.InputThe 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.OutputIf 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
NoteIn 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.

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 3010;
int a[N], b[N];
int f[N][4];
int main(){
 int n;
 scanf("%d", &n);
  for (int i = 1; i <= n; i ++)   scanf("%d", &a[i]);
 for (int i = 1; i <= n; i ++)   scanf("%d", &b[i]);
  memset(f, 0x3f, sizeof f);
    for (int i = 1; i <= n; i ++){
     f[i][1] = b[i];
     for (int k = 1; k < i; k ++)
     if (a[k] < a[i])   
  f[i][2] = min(f[i][2], f[k][1] + b[i]);
          for (int j = 1; j < i; j ++)
         if (a[j] < a[i])
          f[i][3] = min(f[i][3], f[j][2] + b[i]);
 }
  int ans = 1e9;
 for (int i = 1; i <= n; i ++)  ans = min(ans, f[i][3]);
  if (ans == 1e9)   ans = -1;
 cout << ans << endl;
 return 0;
}