#include<iostream>
#include<cstdio>
#include<queue>
#include<set>
using namespace std;
priority_queue<long long,vector<long long>,greater<long long> > q;
set<long long> f;
int n,k,b[300010];
long long t[300010],st[300010],en[300010],ans;
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",&t[i]);
	}
	for(int i=1;i<=k;i++)
	{
		en[i]=t[i];
		q.push(en[i]);
	}
	for(int i=k+1;i<=n;i++)
	{
		st[i]=q.top();
		q.pop();
		en[i]=t[i]+st[i];
		q.push(en[i]);
	}
	ans=q.top();
	f.insert(ans);
	for(int i=n;i>=1;i--)
	{
		if(f.find(en[i])!=f.end())
		{
			f.insert(st[i]);
			if(i<=k) b[i]=1;
		}
	}
	printf("%lld\n",ans);
	for(int i=1;i<=k;i++)
	{
		printf("%d",b[i]);
	}
	return 0;
}