OJ Board

I'm getting WA and I don't know what's wrong with my approach. Maybe I didn't think about some tricky case. Please take a look at my code

const int N = 1000;
int n;
int weight[N];
int load[N];
int bestSumWeight[N]; // bestSumWeight[i] - weight of highest tower
// built from boxes [1..i-1 ...