Adjusted the Largest-First algorithm to pay for outputs collectively instead
of individually.
The updated algorithm should now be successful at paying for any set of
outputs of total value v provided that the total value u of
available inputs satisfies u ≥ v.
The cardinality restriction requiring the number of inputs to be greater than
the number of outputs has been removed.
