What is the algorithm for filling columns according to given conditions?

Question

Mathematics

Good day to all!
There was a following problem, I will be grateful for the help in decisions, or for "direction" of thought in the necessary direction.
We have:
List of contracts.
Each contract consists of certain clauses.
The number of clauses in the contract is random.
Clauses in the contract are not repeated.
In total, there are ... for example, up to 15 clauses of the contract.
Items differ in "significance".
The item with the highest number is the most important, the one with the lowest number is less important.
Each contract has its own "cost", for example, in rubles.
The cost does not depend on the set of clauses in the contract and their significance.
The contract is important.
The importance of the contract consists of the sum of the importance of the clauses included in it.
Example:
A contract worth 200 rubles, consists of clause 1, clause 6 and clause 13. The importance of the contract is 20;
The contract, worth 100 rubles, consists of clause 4, clause 8, clause 14 and clause 15. Importance of the contract 41;
Goal:
There is a base cost N = 100
We have 15 random contracts, the price of each contract is more expensive than the base cost, but no more than 50%. Those. with our base cost, the contract price will be: 100 < Contract price <= 150
Each contract has a random set of points, but not less than 1.
You need to select one contract in each column:
first column: more expensive than N by 1% - 10%
second column: more expensive than costN by 11% - 20%
third column: 21% - 30% more expensive than N 4th column: 31 % - 40% more than N 5th column: 41 % - 50% more than N in each column should differ in the number of points in them upwards as the price rises. 2. You cannot choose the same contracts, and the contracts are equal if they have the same number of points and at the same time their importance is equal. 3. If it is impossible to evenly select a contract in each column, then you can select several contracts from one column, but only if they satisfy the first two rules. And here is a question on the task


: what algorithm should be used to find the maximum possible fullness of the columns.