codeforces/codeforces/732/B.cpp at main · ychaaibi/codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

void    solve(vector<int> days, int k)
{
        int     steps = 0;

        for (int i=1; i<days.size(); i++)
        {

                if (days[i] + days[i - 1] < k)
                {
                        steps += k - (days[i] + days[i - 1]);
                        days[i] += (k - (days[i] + days[i - 1]));
                }
        }
        cout << steps << endl;
        for (int i=0; i<days.size(); i++) cout << days[i] << " ";
        cout << endl;
}

void    parse()
{
        int     s, k;

        cin >> s >> k;
        vector<int>     days(s);
        for (int i=0; i<s; i++) cin >> days[i];
        solve(days, k);
}

int     main()
{
        int     cases = 1;

        //cin >> cases;
        while (cases--)
                parse();
        return (0);
}