摘要：
/*多重背包问题。把a[i]排下序，然后把a[i]作为选第i件物品时的背包容量V。最后结果要[0, max(a[i])]遍历一遍，找到最大值。*///My Code:#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int N = 40007;const int M = 407;class node {public: int h, c, a; friend bool operator < (c 阅读全文