Elevator Rides - DP

#include <bits/stdc++.h>
#define task "TESTCODE"
using namespace std;
int n, w[21], dp[1 << 20][2], x;
void read()
{
   cin >> n >> x;
   for (int i = 0; i < n; ++ i)
   {
       cin >> w[i];
   }
   for (int i = 0; i < (1 << n); ++ i)
   {
       dp[i][0] = 1e9;
       dp[i][1] = 1e9;
   }
   dp[0][0] = 0;
   dp[0][1] = 0;
}
void solve()
{
   for (int i = 0; i < (1 << n); ++ i)
   {
       for (int j = 0; j < n; ++ j)
       {
           if (!(i & (1 << j)))
           {
               int tmp1 = dp[i][0], tmp2 = dp[i][1] + w[j];
               if (tmp2 > x)
               {
                   ++tmp1;
                   tmp2 = w[j];
               }
               if (tmp1 < dp[i | (1 << j)][0])
               {
                   dp[i | (1 << j)][0] = tmp1;
                   dp[i | (1 << j)][1] = tmp2;
               }
               else if (tmp1 == dp[i | (1 << j)][0])
               {
                   dp[i | (1 << j)][1] = min(dp[i | (1 << j)][1], tmp2);
               }
           }
       }
   }
   cout << dp[(1 << n) - 1][0] + 1;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //freopen(task".INP", "r", stdin);
    //freopen(task".OUT", "w", stdout);
    int t = 1;
    bool typetest =false;
    if (typetest)
    {
        cin >> t;
    }
    for (int _ = 1; _ <= t; ++ _ )
    {
        read();
        solve();
    }
    return 0;
}