Wrong solutions to be implemented (MB):
- (1) ternary (over sum cost) or binary (over pressure) search or other similar methods;
- (2) linear-in-memory algorithm that, for weight, stores (maxCost; minNotIncluded) (based on winger's solution for bibliophile);
- (3) solution that tries to fit in memory winger's algorithm that for (weight; index) stores not only maximum weight, but also minimum pressure;
- (4) algorithm based on (2) that tests posssible pressures (although extra N in asymptotic, may work unexpectedly fast);
- (5) backtracks similar to SimpleBranch from bachelor work;
+ (6) random permutations similar to bibliophile's wrong accepted solutions; (seem to not to work in this problem)

If you see any solution ideas you want to be implemented, you may either implement them or add them after this line.
The general assumption is that you will try your best to write complex wrong solutions. Tests will be added ASAP and extra ones will be arriving as 
soon as new solutions are cracked.

