hdu 1171 Big Event in HDU（背包DP）

int v[55], m[55];
bool dp[250005];


int main(){

    int n;
    while(scanf("%d",&n)!=EOF && n>=0){
        int tot = 0;
        rep(i,1,n){
            scanf("%d%d",&v[i],&m[i]);
            tot += (v[i]*m[i]);
        }

        mem(dp,false);
        dp[0]=true;

        rep(i,1,n){
            rep(j,1,m[i]){
                rep2(k,tot,j*v[i]){
                    dp[k]=(dp[k] || dp[k-j*v[i]]);
                }
            }
        }

        int ts = tot/2;
        int ans1=-1,ans2=-1;
        rep2(i,ts,0){
            if(dp[i] && dp[tot-i]){
                ans1=i;
                ans2=tot-i;
                break;
            }
        }

        cout<<ans2<<" "<<ans1<<endl;
    }

    return 0;
}