交易费最大化

You have N transactions, each with <id, size, fee>. You are given a block size of 100. Fill it with transactions such that the fee is maximized.

You must use a 0-1 Knapsack dynamic programming approa...