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;  
    }  
    

      

  • 相关阅读:
    技术文章阅读-Pi-Hole < 4.3.2 Command Injection & PrivEsc (CVE-2019-13051)
    技术文章阅读-d-link-routers-found-vulnerable-rce
    技术文章阅读-蜂网互联企业级路由器v4.31密码泄露漏洞
    使用mkcert工具自签https证书
    查询给定时间是否在当前周
    nodeJS 一些笔记
    手机端页面布局方案
    关于HTML5的应用缓存功能
    将伪数组转换为数组的方法
    Cookies的使用之购物车的实现
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7057909.html
Copyright © 2011-2022 走看看