Vault Split Weight Target

A secure-logistics firm is dispatching an armored truck from its central vault. The truck's suspension is calibrated for a target load of $T$ kilograms: every kilogram above or below the calibration adds strain on the axles and draws unwanted attention at weigh stations. Inside the vault sit $N$ sealed crates, the $i$-th weighing $W_i$ kilograms. Each crate must be taken whole or not at all, and the dispatcher may load any subset of the crates - including sending the truck out completely empty. If the chosen crates weigh $S$ kilograms in total, the strain of the run is $|S - T|$. Pick the subset that minimizes the strain and report the minimum possible value of $|S - T|$. ### Function Description Complete the function `closestVaultLoad` provided in the editor. The function receives the following parameters:

The function must return a single integer - the minimum achievable value of $|S - T|$, where $S$ is the total weight of the loaded subset. ### Input Format - The first line contains two space-separated integers $N$ and $T$. - The second line contains $N$ space-separated integers $W_1, W_2, \ldots, W_N$. ### Output Format Return a single integer: the minimum possible value of $|S - T|$ over all $2^N$ subsets of crates. ### Notes - The empty subset is allowed: an empty truck has $S = 0$ and strain $|0 - T| = T$. - Each crate can be loaded at most once, and crates cannot be split. - Totals can reach $3.8 \times 10^{10}$, so use a 64-bit integer type for sums (`long long` in C++, `long` in Java).