#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline bool chkmin(T &a, T b) {
  return b < a ? a = b, 1 : 0;
}
template <typename T>
inline T read() {
  static T _, __;
  static char c_;
  for (_ = 0, __ = 1, c_ = getchar(); c_ < '0' || c_ > '9'; c_ = getchar())
    if (c_ == '-') __ = -1;
  for (; c_ >= '0' && c_ <= '9'; c_ = getchar())
    _ = (_ << 1) + (_ << 3) + (c_ ^ 48);
  return _ * __;
}
const int maxn = 3e5 + 5;
int n, m, a[maxn], b[maxn], sta[maxn];
long long ans = 0;
inline int getval(int x) {
  if (sta[x] > 1) return (0x3f3f3f3f);
  return sta[x] ? b[x] - a[x] : a[x];
}
set<pair<int, int> > q1, q2;
inline void pick1(long long &x = ans) {
  pair<int, int> t = *q1.begin();
  x += getval(t.second);
  q1.erase(q1.begin());
  --m;
  if (++sta[t.second] == 1) {
    q1.insert(make_pair(getval(t.second), t.second));
    q2.erase(q2.lower_bound(make_pair(b[t.second], t.second)));
  }
}
inline void pick2() {
  pair<int, int> t = *q2.begin();
  q2.erase(q2.begin());
  q1.erase(q1.lower_bound(make_pair(getval(t.second), t.second)));
  ans += t.first;
  sta[t.second] = 2;
  m -= 2;
}
int main() {
  n = read<int>(), m = read<int>();
  for (register int i = (1), i_end_ = (n); i <= i_end_; ++i) {
    a[i] = read<int>(), b[i] = read<int>();
    q2.insert(make_pair(b[i], i)), q1.insert(make_pair(a[i], i));
  }
  while (m) {
    if ((m & 1) || ++q1.begin() == q1.end() || q2.begin() == q2.end())
      pick1();
    else {
      if (q1.begin()->first + (++q1.begin())->first < q2.begin()->first)
        pick1(), pick1();
      else
        pick2();
    }
  }
  cout << ans << endl;
  for (register int i = (1), i_end_ = (n); i <= i_end_; ++i)
    putchar(sta[i] ^ 48);
  return 0;
}
