#include<bits/stdc++.h>
#define lc(x) (t[x].lc)
#define rc(x) (t[x].rc)
#define mid ((l+r)>>1)
using namespace std;
typedef long long ll; 
typedef vector<int> vec;
const ll N = 2.5e5+10,M = 8e6,INF = 1e18;
template<typename T>void tomin(T& x,T y){x = min(x,y);}
template<typename T>void tomax(T& x,T y){x = max(x,y);}

int n,k,a[N],b[N];
int arr[N],rk[N];
ll sa[N];

struct Node{
    int lc,rc,cnt; ll sum;
}t[M]; int tot;
void pu(int x){
    t[x].cnt = t[lc(x)].cnt + t[rc(x)].cnt;
    t[x].sum = t[lc(x)].sum + t[rc(x)].sum;
}
int mdf(int p,int l,int r,int pos,int w){
    int x = ++tot; t[x] = t[p];
    if(l==r){
        t[x].cnt = 1; t[x].sum = w;
        return x;
    }
    (pos<=mid) ? (lc(x) = mdf(lc(x),l,mid,pos,w)) : (rc(x) = mdf(rc(x),mid+1,r,pos,w));
    pu(x);
    return x;
}
ll qry(int x,int y,int l,int r,int cnt){
    if(t[y].cnt - t[x].cnt <= cnt)return t[y].sum - t[x].sum;
    int cR = t[rc(y)].cnt - t[rc(x)].cnt;
    if(cR >= cnt)return qry(rc(x),rc(y),mid+1,r,cnt);
    else return (t[rc(y)].sum - t[rc(x)].sum) + qry(lc(x),lc(y),l,mid,cnt-cR);
}
#undef mid 
int rt[N];

ll ans = -INF; int res[N];
int pos[N]; ll val[N];

ll calc(int L,int R){
    int len = R-L+1; assert(len >= k);
    ll suma = sa[R] - sa[L-1],sumb = qry(rt[L-1],rt[R],1,n,k);
    return sumb - suma;
}
void solve(int l,int r,int L,int R){
    if(l>r || L>R)return;
    int mid = (l+r)>>1;
    val[mid] = -INF;
    for(int j=R;j>=L;j--)if(j>=mid+k-1){
        ll w = calc(mid,j);
        if(w > val[mid])val[mid] = w,pos[mid] = j;
    }
    solve(l,mid-1,L,pos[mid]); solve(mid+1,r,pos[mid],R);
}

int main(){
    ios::sync_with_stdio(false); cin.tie(0);

    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i],sa[i] = sa[i-1] + a[i];
    for(int i=1;i<=n;i++)cin>>b[i],arr[i] = i;
    sort(arr+1,arr+1+n,[&](int x,int y){return b[x] >= b[y];});
    for(int i=1;i<=n;i++)rk[arr[i]] = i;
    for(int i=1;i<=n;i++)rt[i] = mdf(rt[i-1],1,n,rk[i],b[i]);

    solve(1,n-k+1,1,n);
    for(int i=1;i<=n-k+1;i++)tomax(ans,val[i]);
    cout<<ans<<"\n";
    for(int i=1;i<=n;i++)cout<<res[i];
    return 0;
}