0/1 knapsack
RU: задача о рюкзаке 0/1
The problem of maximizing total value over a subset of items whose total weight fits capacity W, taking each item at most once. It is the canonical two-axis DP: one axis is the items considered so far, the other the remaining capacity. Greedy choice by value alone can fail.