#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
int dp[255000],v[5005];
int main()
{
int n;
while (scanf("%d", &n) != EOF)
{
if (n <= 0) continue;
memset(dp, 0, sizeof(dp));
int l = 0, sum = 0;
for (int i = 0; i < n; i++)
{
int x, y;
scanf("%d%d", &x, &y);
sum += x*y;
while (y--)
v[l++] = x;
}
for (int i = 0; i < l; i++)
{
for (int j = sum / 2; j >= v[i]; j--)
dp[j] = max(dp[j], dp[j - v[i]] + v[i]);
}
int a = max(sum - dp[sum / 2], dp[sum / 2]);
int b = min(sum - dp[sum / 2], dp[sum / 2]);
printf("%d %d\n", a, b);
}
return 0;
}
HDU 1171(01背包)
最新推荐文章于 2018-08-16 07:00:57 发布