0 1 yanshen

最新推荐文章于 2021-04-01 16:29:07 发布

山农数学姜赫

最新推荐文章于 2021-04-01 16:29:07 发布

阅读量218

点赞数

分类专栏： dp

本文链接：https://blog.csdn.net/zx8225885qw/article/details/51399844

版权

dp 专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Problem S

Time Limit : 10000/5000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 57 Accepted Submission(s) : 18

Problem Description

Nowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer College had ever been split into Computer College and Software College in 2002. The splitting is absolutely a big event in HDU! At the same time, it is a trouble thing too. All facilities must go halves. First, all facilities are assessed, and two facilities are thought to be same if they have the same value. It is assumed that there is N (0<N<1000) kinds of facilities (different value, different kinds).

Input

Input contains multiple test cases. Each test case starts with a number N (0 < N <= 50 -- the total number of different facilities). The next N lines contain an integer V (0<V<=50 --value of facility) and an integer M (0<M<=100 --corresponding number of the facilities) each. You can assume that all V are different. A test case starting with a negative integer terminates input and this test case is not to be processed.

Output

For each case, print one line containing two integers A and B which denote the value of Computer College and Software College will get respectively. A and B should be as equal as possible. At the same time, you should guarantee that A is not less than B.

Sample Input

Sample Output

对一半的总量进行

0 1 背包的划分

第一个输出总的减去 dp【sum /2】第二个 sum-dp。。；

#include<iostream>
#include<string.h>
#include<set>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
#include<string.h>
#include<fstream>
#include<sstream>
#include<stdio.h>
#include<string>
#include<cstdlib>
#include<algorithm>
#include<iostream>
#include<map>
#include<queue>
#include<iomanip>
#include<cstdio>
using namespace std;
int pao[1000000];
int dp[1000000];
int main()
{
    int n;
    int i,j;
    int w,x,sum;
    int l;
    while(~scanf("%d",&n),n>0)
    {  sum=0;
       l=0;
       memset(dp,0,sizeof(dp));
       memset(pao, 0,sizeof(pao));
       while(n--)
       {
        scanf("%d%d",&w,&x);  //scanf不超时哦1
       while(x--)
       {
           pao[l++]=w;
           sum=sum+w;
       }
       }
       for(i=0;i<l;i++)
       {
           for(j=sum/2;j>=pao[i];j--)
           {
               dp[j]=max(dp[j],dp[j-pao[i]]+pao[i]);
           }
       }
       printf("%d %d\n",sum-dp[sum/2],dp[sum/2]);
    }
    return 0;
}