zoukankan      html  css  js  c++  java
  • Hdu 1171Big Event in HDU

    Big Event in HDU

    Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 41300    Accepted Submission(s): 14208

    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

    2

    10 1

    20 1

    3

    10 1

    20 2

    30 1

    -1

    Sample Output

    20 10

    40 40

    #include <stdio.h>  
    #include <string.h>  
    #include <algorithm>  using namespace std;  
      
    int val[5005];  
    int dp[255555];  
      
    int main()  
    {  
        int n,i,j,a,b,l,sum;  
        while(~scanf("%d",&n),n>0)  
        {  
            memset(val,0,sizeof(val));  
            memset(dp,0,sizeof(dp));  
            l = 0;  
            sum = 0;  
            for(i = 0;i<n;i++)  
            {  
                scanf("%d%d",&a,&b);  
                while(b--)  
                {  
                    val[l++] = a;//将价值存入数组                  sum+=a;  
                }  
            }  
            for(i = 0;i<l;i++)  
            {  
                for(j = sum/2;j>=val[i];j--)//01背包              {  
                    dp[j] = max(dp[j],dp[j-val[i]]+val[i]);  
                }  
            }  
            printf("%d %d
    ",sum-dp[sum/2],dp[sum/2]);  
        }  
      
        return 0;  
    }  
    

      

  • 相关阅读:
    WCF 第二章 契约
    WCF 第二章 契约 两个单向契约VS一个双向契约
    WCF 第二章 契约 数据契约等效
    WCF 第二章 契约 双向操作
    WCF 第二章 契约 服务契约
    Java环境变量配置(Mac)
    java使用document解析xml文件
    使用JDOM解析xml文档
    使用SAX解析xml文档
    sharepoint 2007服务器场迁移到 64 位环境 ^
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057909.html
Copyright © 2011-2022 走看看