Dream City

Dream City

---

Time Limit: 1 Second       Memory Limit: 32768 KB

---

JAVAMAN is visiting Dream City and he sees a yard of gold coin trees. There are n trees in the yard. Let's call them tree 1, tree 2 ...and tree n. At the first day, each tree i has a_i coins on it (i=1, 2, 3...n). Surprisingly, each tree i can grow b_i new coins each day if it is not cut down. From the first day, JAVAMAN can choose to cut down one tree each day to get all the coins on it. Since he can stay in the Dream City for at most m days, he can cut down at most m trees in all and if he decides not to cut one day, he cannot cut any trees later. (In other words, he can only cut down trees for consecutive m or less days from the first day!)

Given n, m, a_i and b_i (i=1, 2, 3...n), calculate the maximum number of gold coins JAVAMAN can get.

Input

There are multiple test cases. The first line of input contains an integer T (T <= 200) indicates the number of test cases. Then T test cases follow.

Each test case contains 3 lines: The first line of each test case contains 2 positive integers n and m (0 < m <= n <= 250) separated by a space. The second line of each test case contains n positive integers separated by a space, indicating a_i. (0 < a_i <= 100, i=1, 2, 3...n) The third line of each test case also contains n positive integers separated by a space, indicating b_i. (0 < b_i <= 100, i=1, 2, 3...n)

Output

For each test case, output the result in a single line.

Sample Input

2
2 1
10 10
1 1
2 2
8 10
2 3

Sample Output

10
21

Hints:
Test case 1: JAVAMAN just cut tree 1 to get 10 gold coins at the first day.

Test case 2: JAVAMAN cut tree 1 at the first day and tree 2 at the second day to get 8 + 10 + 3 = 21 gold coins in all.

 题意：有n棵树，每棵树有一个初始价值和每天增长价值，一共有m天，每天砍一棵树，最大的收益是多少。

分析：利用贪心思想，每天增长价值大的树放在后几天砍收益会高（也可能不砍），因此将每棵树按照每天增长价值多少由小到大排序。由此就转化成了砍或不砍的0-1背包问题，用dp[i][j]表示前i棵树（这i棵树有被砍的也有没被砍的）在第j天所能收获的最大收益，有状态转移方程：dp[i][j]=max(dp[i][j-1],dp[i-1][j-1]*tr[i].a+tr[i].b*(j-1))

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
struct node
{
    int a,b;
}tr[300];
int cmp(node x,node y)
{
    if(x.b!=y.b)
        return x.b<y.b;//根据增长量排序，增长大的排在后面。
    return x.a>y.a;
}
int main()
{
    int t,i,j,dp[255][255],n,m;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);

        for(i=1;i<=n;i++)
            scanf("%d",&tr[i].a);

        for(i=1;i<=n;i++)
            scanf("%d",&tr[i].b);

        sort(tr+1,tr+n+1,cmp);//增长最大的树留到最后砍收益最大

        for(i=1;i<=n;i++)
        {
            for(j=1;j<=m;j++)
            {
                dp[i][j]=max(dp[i-1][j],dp[i-1][j-1]+tr[i].b*(j-1)+tr[i].a);//不砍或者砍
            }
        }
        printf("%d\n",dp[n][m]);
    }
    return 0;
}