多重部分和问题

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int n, k, a[1000], m[1000];
int dp[1000];
void solve()
{
memset(dp, -1, sizeof(dp));
dp[0] = 0;
for (int i = 0; i < n; i++){
for (int j = 0; j <= k; j++){
if (dp[j] >= 0){
dp[j] = m[i];
}
else if (j < a[i] || dp[j - a[i]] <= 0){
dp[j] = -1;
}
else{
dp[j] = dp[j - a[i]] - 1;
}
}
}
if (dp[k] >= 0)
printf("Yes\n");
else
printf("No\n");
}

int main()
{
while (scanf("%d%d", &n, &k) != EOF){
for (int i = 0; i < n; i++){
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++){
scanf("%d", &m[i]);
}
solve();
}
return 0;
}