Hello 2018 C - Party Lemonade

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 30 + 7, maxd = 1e5 + 7;

const ll mod = 1e9 + 7;
const ll INF = 0x7f7f7f7f7f7f7f7f;

ll n, L;
ll a[maxn], b[maxn];

int main() {
    b[1] = 1;
    for(int i = 2; i < 31; ++i) {
        b[i] = b[i-1]*2L;
    }
    scanf("%lld%lld", &n, &L);
    for(int i = 1; i <= n; ++i) {
        scanf("%lld", &a[i]);
    }
    for(int i = 1; i < n; ++i) {
        if(a[i]*2L < a[i+1]) {
            a[i+1] = a[i]*2L;
        }
    }
    for(int i = n-1; i < 0; --i)
        a[i] = min(a[i], a[i] + 1);

    ll  ans = INF;
    ll t = 0;
    for(int j = n; j > 0; --j) {
        t += (L/b[j])*a[j];
        L %= b[j];
        ans = min(ans, t+a[j]);
    }
    ans = min(ans, t);
    printf("%lld", ans);
    return 0;
}