rt玄关

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int n,ans[N],ta[N],tb[N],a[N],b[N];
struct node{
	int minn;
	int num;
}e[10000];
bool cmp(node x,node y){
	return x.minn < y.minn;
}
int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		e[i].num=i;
	}
	for(int i=1;i<=n;i++){
		cin>>b[i];
		e[i].minn=min(a[i],b[i]);
	}
	sort(e+1,e+1+n,cmp); 
	int t1=0,t2=n+1;
	for(int i=1;i<=n;i++){
		if(e[i].minn==a[e[i].num]){ 
			t1++;
			ans[t1]=e[i].num;
		}
		else{ 
			t2--;
			ans[t2]=e[i].num;    
		}
	}
	for(int i=1;i<=n;i++){
		ta[i]=ta[i-1]+a[ans[i]];
		tb[i]=tb[i-1]+b[ans[i]];
	}
	int sum=-1;
	for(int i=1;i<=n;i++){
		sum=max(tb[i],ta[i]);
	}
	cout<<sum+1<<"\n";
	for(int i=1;i<=n;i++)
		cout<<ans[i]<<" ";
	return 0;
}