Ural-1005. Stone Pile(简单01背包)

1005. Stone Pile
 
 

  
  Time limit: 1.0 second
Memory limit: 64 MB

 
 
 
 

  
  

   
   

    
    You have a number of stones with known weights w1, …, wn. Write a program that will rearrange the stones into two piles such that weight difference between the piles is minimal.
   
   
  
  
  
  
Input
  
  

   
   

    
    Input contains the number of stones n (1 ≤ n ≤ 20) and weights of the stones w1, …, wn (integers, 1 ≤ wi ≤ 100000) delimited by white spaces.
   
   
  
  
  
  
Output
  
  

   
   

    
    Your program should output a number representing the minimal possible weight difference between stone piles.
   
   
  
  
  
  
Sample
  
  
input
output
5
5 8 13 27 14
3
      
      
 
       
 
      
 
 

题意：一堆石子,每个石子有不同的重量,将其分为2堆,使得两堆的重量相差最小,最小是多少？

思路：以所有的石子的重量和为背包容量,进行01背包,最后求两堆的最小差。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>

using namespace std;
int n;
int arr[30],pack[2000005];
int sum;
int main()
{
//    freopen("in.txt","r",stdin);
//    freopen("out.txt","w",stdout);
    memset(pack,0,sizeof(pack));
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        scanf("%d",&arr[i]);
        sum += arr[i];
    }
    for(int i=0;i<n;i++) // 进行01背包
    {
        for(int j=sum;j>=arr[i];j--)
        {
            if(pack[j]<pack[j-arr[i]]+arr[i])
            {
                pack[j] = pack[j-arr[i]]+arr[i];
            }
        }
    }
    int minn = 2000005;
    for(int i=0;i<=sum;i++)//寻找最小差
    {
        if(pack[i]&&abs(sum-pack[i]-pack[i])<minn)
        {
            minn = abs(sum-pack[i]-pack[i]);
        }
    }
    printf("%d\n",minn);
    return 0;
}