#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
char ch; while(!isdigit(ch=getchar()));
for(x=ch-'0';isdigit(ch=getchar());x=x*10+ch-'0');
}
typedef long long LL;
const int MAXN = 600005;
int n, w, cnt1, cnt2, mn[MAXN];
struct node {
int x, y, id;
inline bool operator <(const node &o)const {
return x+y < o.x+o.y;
}
}a[MAXN], b[MAXN];
LL g[MAXN], h[MAXN];
int c[MAXN];
int main () {
read(n), read(w);
for(int i = 1, x, y; i <= n; ++i) {
read(x), read(y); y -= x;
if(x < y) a[++cnt1] = (node){ x, 0, i }, a[++cnt1] = (node){ y, 0, i };
else b[++cnt2] = (node){ x, y, i };
}
sort(a + 1, a + cnt1 + 1);
sort(b + 1, b + cnt2 + 1);
memset(g, -1, sizeof g); g[0] = 0;
memset(h, -1, sizeof h); h[0] = 0;
for(int i = 1; i <= cnt1; ++i) g[i] = g[i-1] + a[i].x;
mn[cnt2+1] = 1000000000;
for(int i = cnt2; i >= 1; --i) mn[i] = min(mn[i+1], b[i].x);
for(int i = 1, j, mx = 0; i <= cnt2<<1; ++i)
if(i&1) j = (i+1)>>1, h[i] = min(h[i-1] + mn[j], h[i-1] + b[j].x + b[j].y - mx), mx = max(mx, b[j].y);
else j = i>>1, h[i] = h[i-2] + b[j].x + b[j].y;
LL ans = 1ll<<60; int i=0;
for(int j = 0; j <= w; ++j)
if(~g[w-j] && ~h[j] && g[w-j]+h[j] < ans) ans = g[w-j]+h[j], i = j;
printf("%lld\n", ans);
for(int j = 1; j <= w-i; ++j) ++c[a[j].id];
int x = (i&1) ? (i+1)>>1 : i>>1;
for(int j = 1; j <= x; ++j) c[b[j].id] += 2;
if(i&1) {
if(h[i] == h[i-1] + mn[x]) {
c[b[x].id] -= 2;
for(int j = x; j <= cnt2; ++j)
if(b[j].x == mn[x]) { ++c[b[j].id]; break; }
}
else {
int mx = h[i-1] + b[x].x + b[x].y - h[i];
for(int j = 1; j < x; ++j) if(b[j].y == mx) { --c[b[j].id]; break; }
}
}
for(int j = 1; j <= n; ++j) printf("%d", c[j]);
}