Zepto Code Rush 2014
E
Cardboard Box
Codeforces
2600
原题
← DF →
翻译中…

Everyone who has played Cut the Rope knows full well how the gameplay is organized. All levels in the game are divided into boxes. Initially only one box with some levels is available. Player should complete levels to earn stars, collecting stars opens new box with levels.

翻译中…

image

翻译中…

Imagine that you are playing Cut the Rope for the first time. Currently you have only the levels of the first box (by the way, it is called "Cardboard Box"). Each level is characterized by two integers: $*a*_{*i*}$ — how long it takes to complete the level for one star, $*b*_{*i*}$ — how long it takes to complete the level for two stars $(*a*_{*i*} < *b*_{*i*})$.

翻译中…

You want to open the next box as quickly as possible. So, you need to earn at least $*w*$ stars. How do make it happen? Note that the level can be passed only once: either for one star or for two. You do not necessarily need to pass all the levels.

翻译中…

Input

翻译中…

The first line contains two integers $*n*$ and $*w*$ $(1 ≤ *n* ≤ 3·10^{5}; 1 ≤ *w* ≤ 2*n*)$ — the number of levels in the first box and the number of stars you need to open another box. Each of the following $*n*$ lines contains two integers $*a*_{*i*}$ and $*b*_{*i*}$ $(1 ≤ *a*_{*i*} < *b*_{*i*} ≤ 10^{9})$ — the attributes of the $*i*$-th level.

翻译中…

Output

翻译中…

In the first line print integer $*t*$ — the minimum time you need to open the next box.

翻译中…

In the next line, print $*n*$ digits without spaces — the description of the optimal scenario:

翻译中…
  • if you need to pass the $*i*$-th level for one star, the $*i*$-th digit should equal 1;
  • if you need to pass the $*i*$-th level for two stars, the $*i*$-th digit should equal 2;
  • if you do not need to pass the $*i*$-th level at all, the $*i*$-th digit should equal 0.
翻译中…

Note

翻译中…

In the first test sample, answer 21 is also assumed correct.

翻译中…

样例

Input #1
2 3
1 2
1 2
Output #1
3
12
InputCopy OutputCopy
Input #2
5 3
10 20
5 10
10 20
6 9
25 30
Output #2
14
01020
InputCopy OutputCopy
题目信息
题号
436E
时间限制
5 s
内存限制
256 MB
标签
数据结构
贪心

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。