#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1) #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2) #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = ll; val op(val a, val b) { return a + b; } val e() { return 0; } val mp(func f, val a) { return a + f; } func comp(func f, func g) { return f + g; } func id() { return 0; } ll g; bool f(val a) { return a < g; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; //ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; //ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n; cin >> n; n *= 2; auto [c, l, r] = read_tuple(n); ll sum = 0; ll mn = 0; VL lefts; priority_queue> que; ll ans = 0; string tmp(n, 'R'); PER(i, n) { if (c[i] == '(') { sum--; ans += r[i]; que.emplace(l[i] - r[i], i); } else { sum++; if (que.empty()) { ans += r[i]; } else{ auto [cc, ii] = que.top(); if (cc + l[i] - r[i] > 0) { que.pop(); ans += cc + l[i]; tmp[ii] = 'L'; tmp[i] = 'L'; } else { ans += r[i]; } } } if (sum < mn) { // 今までの'('の中で、一番損失が少ない奴をLに変える auto [cc, ii] = que.top(); ans += cc; tmp[ii] = 'L'; que.pop(); mn = sum; } } while (!que.empty()) { auto [cc, ii] = que.top(); if (cc > 0) { ans += cc; tmp[ii] = 'L'; } que.pop(); } cout << ans << endl; string tt; REP(i, n) { if (tmp[i] == 'L') { tt.insert(tt.begin(), c[i]); } else { tt.push_back(c[i]); } } ll nb = 1LL << n; ll mx = 0; REP(b, nb) { string t2; ll sum = 0; REP(i, n) { if (EXISTBIT(b,i)) { t2.insert(t2.begin(), c[i]); sum += l[i]; } else { t2.push_back(c[i]); sum += r[i]; } } ll cnt = 0; ll mn = 0; REP(i, n) { if (t2[i] == '(') cnt++; else cnt--; CHMIN(mn, cnt); } if (mn == 0 && mx < sum) { cout << bitset<14>(b) << ":" << sum << " " << t2 << endl; mx = sum; } } cout << tmp << " " << tt; return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }