编辑代码

#include<stdio.h>
#include<iostream>
using namespace std;
#define max 10
 
void dfs(int i, int n, int W, int* w, int* v, int tw, int tv, int* temp, int* x, int maxv) {
 if (i == n) {
  if (tw == W && tv > maxv) {
   maxv = tv;
   for (int j = 0; j < n; j++)
    x[j] = temp[j];
  }
  return;
 }
 temp[i] = 1;
 dfs(i + 1, n, W, w, v, tw + w[i], tv + v[i], temp, x, maxv);
 temp[i] = 0;
 dfs(i + 1, n, W, w, v, tw, tv, temp, x, maxv);
}
 
int main() {
 int w[] = { 5,3,2,1 };
 int v[] = { 4,4,3,1 };
 int x[max];
 int temp[max];
 memset(x, 0, sizeof(x));
 memset(temp, 0, sizeof(temp));
 int n = 4;
 int W = 6;
 int maxv = 0;
 dfs(0, n, W, w, v, 0, 0, temp, x, maxv);
 for (int i = 0; i < n; i++)
  cout << x[i] << " ";
 return 0;
}