OJ Board

Consider following case

5
2 10
2 10
2 21
20 1
1 2

output should be 4

anyway i used memoization but got TLE
can anyone give any hint

This can be solved using 0/1 knapsack

use a table Tab[C][B] where
B is no of bricks and
C is total copper content (not concentration) in B bricks

Tab[C][B] contains minimum price of purchasing B bricks where total copper content in B bricks is C

MAX_B=20
MAX_C=1000*20

hope this helps

My AC code says "2 2 1" is not an A sequence

try STL next_permutation

Isnt it a usaco problem?
i solved it using memoization

max_profit(i,j)=MAX((a[i]+sum[i+1][j]-max_profit(i+1,j)),(a[j]+sum[i][j-1]-max_profit(i,j-1)))