uva 12589 dp

#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn = 55;struct Node{int x, y;bool operator < (const Node &b) const//斜率排序{if (y * b.x == b.y * x) return x > b.x;return y * b.x > b.y * x;}void read(){scanf("%d%d", &x, &y);}};Node node[maxn];int dp[maxn * maxn][maxn], kase, n, k, T;int main(int argc, char const *argv[]){scanf("%d", &T);while (T--){scanf("%d%d", &n, &k);memset(dp, -0x3f, sizeof(dp));dp[0][0] = 0;for (int i = 0; i < n; ++i)node[i].read();sort(node, node + n);for (int i = 0; i < n; ++i)//前i个for (int j = maxn * maxn - 1; j >= 0; --j)//高度为jfor (int l = k - 1; l >= 0; --l)//选了l个if (dp[j][l] >= 0)dp[j + node[i].y][l + 1] = max(dp[j + node[i].y][l + 1], (node[i].y + 2 * j) * node[i].x + dp[j][l]);int ans = 0;for (int i = maxn * maxn - 1; i >= 0; --i) ans = max(ans, dp[i][k]);printf("Case %d: %d\n", ++kase, ans);}return 0;}