number of items: 5
knapsack capacity: 26

item weights:   12 7 11 8 9
item values:    24 13 23 15 16

optimal solution (binary vector, items indexed from 1 to n):
0 1 1 1 0
