OJ Board

TLE... can anyone help me :@ code: #include <iostream> #include <string> #include <climits> #include <algorithm> using namespace std; int weight[1000+10]; int prize[1000+10]; int dp[1000+10][40]; int n, res; int ww, num; int maX(int index, int w, int p) { if(index == n) { if(w <= ww) return dp[index...