#include <iostream>
using namespace std;
//
#include <iostream>
#include <fstream>
using namespace std;
void backtrack(int i,int n,int c1,int *x,int *w,int r) {
if (i > n) {
if (cw > bestw) {
for (int i = 1; i <= n; i++) {
bestx[i] = x[i];
}
bestw = cw;
}
return;
}
r -= w[i];
if (cw + w[i] <= c1) {
x[i] = 1;
cw += w[i];
backtrack(i+1,n,c1,x,w,r);
cw -= w[i];
}
if (cw+r>bestw) {
x[i] = 0;
backtrack(i+1,n,c1,x,w,r);
}
r += w[i];
}
cw += w[i];
backtrack(i+1,n,c1,x,w,r);
cw -= w[i];
}//为什么递归最后还要再加上一个cw -= w[i];语句呢,看了好久没看懂,求解答QAQ
'''
cw += w[i];
backtrack(i+1,n,c1,x,w,r);
cw -= w[i];
}//为什么递归最后还要再加上一个cw -= w[i];语句呢,看了好久没看懂,求解答QAQ