题目如下:
AC代码如下:
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int dp[259][259];
struct nn
{
int base;
int more;
}s[259];
bool cmp(nn x, nn y)
{
//if (x.more < y.more)
//return x.more < y.more;
//else
return x.more < y.more;
}
int main()
{
int T;
cin >> T;
while (T--)
{
memset(dp, 0, sizeof dp);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
scanf("%d", &s[i].base);
}
for (int i = 1; i <= n; i++)
{
scanf("%d", &s[i].more);
}
sort(s+1, s + n+1, cmp);
//for(int i = 1;i<=n;i++)
//cout<<s[i].base<<' '<<s[i].more<<endl;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= m; j++)
{
dp[i][j] = max(dp[i-1][j], dp[i-1][j-1] + s[i].base + s[i].more * (j-1));
}
}
cout << dp[n][m] << endl;
/*for(int i = 0;i<=n;i++)
{
for(int j = 0;j<=m;j++)
{
cout<<dp[i][j]<<' ';
}
cout<<endl;
}*/
}
}
题目解析:
因为每天都能长出bi枚金币,所以需要先进行一波小贪心!(bi大的最后再砍,这样收益才更高!)
因此,先进行结构体排序,然后用01背包思想找到最优解!