解题思路:
(1)动态规划,dp[n]=去重(dp[n-1]+{dp}+v[n])
#include<iostream>
#include<vector>
#include<iostream>
#include<unordered_map>
using namespace std;
int helper(vector<int> &weight,vector<int> &num) {
vector<int> v;
for(int i=0;i<num.size();i++) {
for(int j=0;j<num[i];j++) {
v.push_back(weight[i]);
}
}
unordered_map<int,int> mp;
mp[0]=0;
for(int i=0;i<v.size();i++) {
vector<int> vec;
for(auto it=mp.begin();it!=mp.end();it++) {
vec.push_back(it->first+v[i]);
}
for(int j=0;j<vec.size();j++) {
mp[vec[j]]=0;
}
}
return mp.size();
}
int main() {
int n,a;
while(cin>>n) {
vector<int> weight,num;
for(int i=0;i<n;i++) {
cin>>a;
weight.push_back(a);
}
for(int i=0;i<n;i++) {
cin>>a;
num.push_back(a);
}
cout<<helper(weight,num)<<endl;
}
return 0;
}