UVa : 562


// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <sstream>
#include <set>
#include <math.h>
#define N 1000000
using namespace std;


int main ()
{
    int testCase;
    scanf ("%d", &testCase);

    while ( testCase-- ) {
        int n;
        scanf ("%d", &n);

        int coin [100 + 5];
        int totalSum = 0;

        for ( int i = 0; i < n; i++ ) {
            scanf ("%d", &coin [i]);
            totalSum += coin [i];
        }

        int dp [50000 + 10];
        memset (dp, 0, sizeof (int) * 50010);

        dp [0] = 1;

        for ( int i = 0; i < n; i++ ) {
            for ( int j = totalSum; j >= 0; j-- ) {
                if ( dp [j] )
                    dp [j + coin [i]] = 1;
            }
        }

        int diff;

        if ( totalSum % 2 == 0 ) {
            for ( int i = totalSum / 2; i >= 0; i-- ) {
                if ( dp [i] ) {
                    diff = i;
                    break;
                }
            }

            printf ("%d\n", ((totalSum / 2) - diff) * 2);
        }
        else {
            for ( int i = totalSum / 2; i >= 0; i-- ) {
                if ( dp [i] ) {
                    diff = i;
                    break;
                }
            }

            printf ("%d\n", ((totalSum / 2) - diff) * 2 + 1);
        }
    }

    return 0;
}

// @END_OF_SOURCE_CODE

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s