732B - Cormen --- The Best Friend Of a Man

B. Cormen — The Best Friend Of a Man
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Recently a dog was bought for Polycarp. The dog’s name is Cormen. Now Polycarp has a lot of troubles. For example, Cormen likes going for a walk. Empirically Polycarp learned that the dog needs at least k walks for any two consecutive days in order to feel good. For example, if k = 5 and yesterday Polycarp went for a walk with Cormen 2 times, today he has to go for a walk at least 3 times. Polycarp analysed all his affairs over the next n days and made a sequence of n integers a1, a2, …, an, where ai is the number of times Polycarp will walk with the dog on the i-th day while doing all his affairs (for example, he has to go to a shop, throw out the trash, etc.).Help Polycarp determine the minimum number of walks he needs to do additionaly in the next n days so that Cormen will feel good during all the n days. You can assume that on the day before the first day and on the day after the n-th day Polycarp will go for a walk with Cormen exactly k times. Write a program that will find the minumum number of additional walks and the appropriate schedule — the sequence of integers b1, b2, …, bn (bi ≥ ai), where bi means the total number of walks with the dog on the i-th day.
Input
The first line contains two integers n and k (1 ≤ n, k ≤ 500) — the number of days and the minimum number of walks with Cormen for any two consecutive days. The second line contains integers a1, a2, …, an (0 ≤ ai ≤ 500) — the number of walks with Cormen on the i-th day which Polycarp has already planned. Output
In the first line print the smallest number of additional walks that Polycarp should do during the next n days so that Cormen will feel good during all days. In the second line print n integers b1, b2, …, bn, where bi — the total number of walks on the i-th day according to the found solutions (ai ≤ bi for all i from 1 to n). If there are multiple solutions, print any of them.
Examples
Input
3 5
2 0 1
Output
4
2 3 2
Input
3 1
0 0 0
Output
1
0 1 0
Input
4 6
2 4 3 5
Output
0
2 4 3 5
题大意是，要遛n狗天狗，在任意俩天必须遛够k次，狗才开心。狗主每天都有a次是自身需要出去的。为了狗狗开心，狗主人需要额外出去多少次。
解法：在不足的俩天中的后一天加上要额外出去的次数。

#include<iostream>
using namespace std;
int main()
{
 int i,j,k,n,sum=0,sum1=0;
 int a[501];
 cin>>n>>k;
 for(i=0;i<n;i++)
 {
  cin>>a[i];
 }
 for(i=1;i<n;i++)
 {
  sum=a[i]+a[i-1];
  if(sum<k)
  {
   sum1+=k-sum;
   a[i]+=(k-sum);//加上不足次数
  }  
 }
 cout<<sum1<<'\n';
 for(i=0;i<n;i++)
 {
  cout<<a[i]<<" ";
 }
 cout<<'\n'; 
  
 return 0;
 }