1172-Hiking

(http://acm.xidian.edu.cn/problem.php?id=1172)

#include <stdio.h>
#include<algorithm> 
#include<cstring>   
#define maxn 20000+5
using namespace std;

int a,b,T,c[maxn];  
int dp[maxn];  

int main()  
{  
    while(scanf("%d",&T)!=EOF)  
    {  
        memset(dp,0,sizeof(dp));
        int sum=0;  
        for(int i=0;i<T;i++)  
        {  
            scanf("%d",&c[i]); 
            sum+=c[i];  
        }  
        for(int j=0;j<T;j++)  
        {  
            for(int k=sum/2;k>=c[j];k--)  
            {  
                dp[k] = max(dp[k],dp[k-c[j]]+c[j]);  
            }  
        }  
        printf("%d\n",sum-2*dp[sum/2]);  
    }  
    return 0;  
}