zoukankan      html  css  js  c++  java
  • Dawn-K's water(完全背包)

    Dawn-K recently discovered a very magical phenomenon in the supermarket of Northeastern University: The large package is not necessarily more expensive than the small package.

    On this day, Dawn-K came to the supermarket to buy mineral water, he found that there are nn types of mineral water, and he already knew the price pp and the weight cc (kg) of each type of mineral water. Now Dawn-K wants to know the least money aa he needs to buy no less than mm kilograms of mineral water and the actual weight bb of mineral water he will get. Please help him to calculate them.

    Input

    The input consists of multiple test cases, each test case starts with a number nn (1 le n le 10^31n103) -- the number of types, and mm (1 le m le 10^41m104) -- the least kilograms of water he needs to buy. For each set of test cases, the sum of nn does not exceed 5e45e4.

    Then followed n lines with each line two integers pp (1 le p le 10^91p109) -- the price of this type, and cc (1 le c le 10^41c104) -- the weight of water this type contains.

    Output

    For each test case, you should output one line contains the minimum cost aa and the weight of water Dawn-K will get bb. If this minimum cost corresponds different solution, output the maximum weight he can get.

    (The answer aa is between 11 and 10^9109, and the answer bb is between 11 and 10^4104)

    样例输入

    3 3
    2 1
    3 1
    1 1
    3 5
    2 3
    1 2
    3 3
    

    样例输出

    3 3
    3 6
    做了好几遍没过,卡long long 了,一定注意数据范围
    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    const int maxn=2e4+5;
    int p[maxn],w[maxn];
    ll dp[maxn];
    int main()
    {
        int n,m;
        while(cin>>n>>m)
        {
            for(int i=1;i<=n;i++)
                cin>>p[i]>>w[i];
            for(int i=1;i<maxn;i++)
                dp[i]=1e18;
            dp[0]=0;
            for(int i=1;i<=n;i++){
                for(int j=w[i];j<maxn;j++){
                    dp[j]=min(dp[j],dp[j-w[i]]+p[i]);
                }
            }
            ll a=1e18,b=0;
            for(int i=m;i<maxn;i++){
                if(dp[i]<=a){
                    a=dp[i];
                    b=i;
                }
            }
            cout<<a<<" "<<b<<endl;
        }
        return 0;
    }
  • 相关阅读:
    UVA 12467
    UVA 12604
    部署ASP.NET MVC项目
    以路由控制URL
    Week13(12月2日):又到了那个点,期末了~~~~
    购物网站讨论5:会员功能的实现
    购物网站讨论4:订单结账功能实现
    购物网站讨论3:购物车功能实现
    购物网站讨论2:商品浏览功能实现
    购物网站讨论1:关于模型那些事
  • 原文地址:https://www.cnblogs.com/ylrwj/p/11930481.html
Copyright © 2011-2022 走看看