#include<bits/stdc++.h>
#define maxn 300010
#define ll long long
using namespace std;
int n,k;
ll a[maxn],st[maxn],ed[maxn];
priority_queue<ll>q;
set<ll>s;
bool b[maxn];
int main(){
	freopen("interview.in","r",stdin);
	freopen("interview.out","w",stdout); 
	scanf("%d%d",&n,&k);
	for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
	for(int i=1;i<=k;i++)ed[i]=a[i],q.push(-ed[i]);
	for(int i=k+1;i<=n;i++){
		ll x=-q.top();q.pop();
		st[i]=x,ed[i]=x+a[i];
		q.push(-ed[i]);
	}
	printf("%lld\n",-q.top());
	s.insert(-q.top());
	for(int i=n;i>=1;i--){
		if(s.find(ed[i])!=s.end()){
			s.insert(st[i]);
			if(i<=k)b[i]=1;
		}
	}
	for(int i=1;i<=k;i++)printf("%lld",b[i]);
	return 0;
}