#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;
template<class A, class B>
bool maximize(A& x, B y) {
if (x < y) return x = y, true; else return false;
}
template<class A, class B>
bool minimize(A& x, B y) {
if (x > y) return x = y, true; else return false;
}
/* END OF TEMPLATE */
const int N = 2e5 + 7;
int p[N], u[N], d[N], n;
bool checkSub1() {
REP(i, 1, n)
if (p[i] != i - 1) return false;
return true;
}
namespace sub1 {
ll Process() {
ll res = 0, sum_t = 0;
REP(i, 0, n) {
sum_t+=d[i];
res+=1LL * u[i] * sum_t;
}
return res;
}
}
int64_t scheduling_cost(vector<int> P, vector<int> U, vector<int> D) {
n = P.size();
REP(i, 0, n) {
p[i] = P[i];
u[i] = U[i];
d[i] = D[i];
}
if (checkSub1()) {
return sub1::Process();
}
}
