← 返回题目

题库练习 Ber Patio

← 上一题下一题 →

A10595 | $Ber Patio$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

The first line contains two integer numbers $n$ and $b$ ( $1<=n<=5000$ , $0<=b<=10^{5}$ ) — number of days and initial number of bonuses Polycarp has. The second line contains the integer sequence $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=1000$ ), where $a_{i}$ is the amount of burles in the $i$ -th day's receipt. It is guaranteed that the sum of all receipts does not exceed $10^{5}$ burles.

输入格式

On the first line, print the expected minimal number of burles to pay for all $n$ receipts. On the second line, print the sequence of integer numbers $b_{1},b_{2},...,b_{n}$ , where $b_{i}$ is the number of bonuses to use on the $i$ -th day. If there are multiple solutions, print any of them.

输出格式

无

输入输出样例

输入 #1

3 21
12 75 52

输出 #1

110
2 5 22

输入 #2

3 39
58 64 33

输出 #2

107
28 4 16

C++ 编辑器

输入

输出