#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int m[100];
int p[100];
int S[100];
int main(int argc, char const *argv[])
{
int num;
cin>>num;
while(num --){
memset(p,0,sizeof(p));
memset(m,0,sizeof(m));
memset(S,0,sizeof(S));
int n;
int k;
cin>>n>>k;
for (int i = 0; i < n; ++i)
{
cin>> m[i];
}
for (int i = 0; i < n; ++i)
{
cin>> p[i];
}
for (int i = 0; i < n; ++i)
{
if (i == 0)
{
S[i] = p[i];
}
else{
S[i] = p[i];
for (int j = 0 ; j < i; j ++)
{
if(m [i] - m[j] > k){
S[i] = max(S[j] + p[i],S[i]);
}
}
}
}
int maxn = 0;
for(int i = 0;i < n;i++)
maxn = max(maxn,S[i]);
printf("%d\n",maxn);
}
}
POJ开餐馆
最新推荐文章于 2022-06-01 17:56:39 发布