#include<bits/stdc++.h> using namespace std; const int N = 2005; struct data { int id,a,b; } J[N], ans[N]; int n; inline bool cmp(const data &A, const data &B) { return min(A.a, A.b) < min(B.a, B.b); } int main() { scanf("%d", &n); for(int i = 1; i <= n; ++i) { scanf("%d", &J[i].a); J[i].id = i; } for(int i = 1; i <= n; ++i) scanf("%d", &J[i].b); sort(J + 1, J + 1 + n, cmp); for(int i = 1, p = 1, q = n; i <= n; ++i) { if(J[i].a <= J[i].b) ans[p++] = J[i]; else ans[q--] = J[i]; } int time1 = 0, time2 = 0; for(int i = 1; i <= n; ++i) { time1 += ans[i].a; time2 = max(time1, time2); time2 += ans[i].b; } printf("%d\n", time2); for(int i = 1; i <= n; ++i) printf("%d ", ans[i].id); return 0; }