01背包问题（两种状态）UVa-12563 - Jin Ge Jin Qu hao

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int time_[5555] = {0};
int dp[255555] = {0};

int main()
{
int n;
while (cin >> n && n != -1)
{
memset(time_, 0, sizeof(time_));
memset(dp, 0, sizeof(dp));
int index = 0;
int len = 0;
while (n--)
{
int v, c;
cin >> v >> c;
len += v * c;
{
time_[index++] = v;
}
while (c--)

}
for (int i = 0; i < index; i++)
{
for (int j = len / 2; j >= time_[i]; j--)
// for (int j = 0; j <= len / 2; j++)
{
dp[j] = max(dp[j], dp[j - time_[i]] + time_[i]);
}
}

cout << len - dp[len / 2] << " " << dp[len / 2] << endl;
}
return 0;
}