#include using namespace std; template using min_priority_queue = priority_queue,greater>; template void printv(vector &v){ bool b = false; for(auto i : v){ if(b) cout << " "; else b = true; cout << i; } cout << endl; } int64_t rand64(){ int64_t l = rand(); int64_t r = rand(); return (l<<31)+r; } template bool chmin(T &a, const T& b) { if (a > b) { a = b; // aをbで更新 return true; } return false; } template bool chmax(T &a, const T& b) { if (a < b) { a = b; // aをbで更新 return true; } return false; } bool yn(bool b){ if(b) cout << "Yes" << endl; else cout << "No" << endl; return b; } bool debug; bool randomInput; bool debugOutput; int numOfTestCase; using ans_type = int; void input(){ if(numOfTestCase > 1){ } if(randomInput){ } else{ } return; } void output_input(){ ; } ans_type calc(){ int N; string S; cin >> N >> S; vector A(2*N); for(auto &i : A) cin >> i; int64_t INF = 1001002003004005006; vector> dp(2*N+1, vector(N+1, INF)); dp[0][0] = 0; for(int i = 0; i < 2*N; i++){ for(int j = 0; j <= i && j <= 2*N - i; j++){ if(j - 1 >= 0) chmin(dp[i+1][j-1], dp[i][j] + A[i] * (S[i] == '(')); if(j + 1 <= 2 * N - (i + 1)) chmin(dp[i+1][j+1], dp[i][j] + A[i] * (S[i] == ')')); } } cout << dp[2*N][0] << endl; return ans_type(); } ans_type calc_simple(){ return ans_type(); } void output(ans_type ans){ return; } int main(){ debug = 0; randomInput = 0; debugOutput = 0; numOfTestCase = 1; srand(time(NULL)); cout << fixed << setprecision(12); if(numOfTestCase == 0) cin >> numOfTestCase; if(debug){ for(int i = 0; i < numOfTestCase; i++){ if(debugOutput) cout << string(16, '-') << endl; input(); ans_type ans = calc(); ans_type ansSimple = calc_simple(); if(ans != ansSimple){ output_input(); output(ans); output(ansSimple); } } } else{ for(int i = 0; i < numOfTestCase; i++){ input(); output(calc()); } } return 0; }