#include <iostream>
using namespace std;
void Knapsack(int *v, int *w, int c, int n, int **m);
int main()
{
//0-1 bag problem, using dynamic programming
int c;//weight constrain of the bag
int *v;//value of goods
int n;//kinds of goods
int **m;//m(i,j) means optimal value