代码及解释
#include <iostream>
#include <cmath>
#include <cstring>
const int SIZE = 100010;
int f[SIZE];
int a[SIZE];
int main() {
int t;
while(std::cin >> t) {
if(t < 0) break;
memset(f, 0, sizeof(f));
int sum = 0, k = 0;
for(int i = 0; i < t; ++i) {
int n, m;
std::cin >> n >> m;
sum += n * m;
for(int j = 0; j < m; ++j)
a[k++] = n;
}
int mid = sum / 2;
for(int i = 0; i < k; ++i)
for(int j = mid; j >= a[i]; --j)
f[j] = std::max(f[j],f[j - a[i]] + a[i]);
std::cout << sum - f[mid] << " " << f[mid] << std::endl;
}
return 0;
}