CodeForces 3B Lorry 贪心

原创 2015年07月10日 09:24:27

题目大意是有体积为v的背包,有体积为1和2的两种物品若干,这些物品都有各自的价值。求如何取这些物品可使背包中物品的价值最大。

开始一看到是背包就傻眼了==因为数据量太大1 ≤ n ≤ 1051 ≤ v ≤ 10

搜题解有说用优先队列做的,好麻烦==有一种思路我很喜欢:既然涉及到背包或者贪心这类DP问题,一定是取最优的解。即如果把两种船只分别存到两个数组里,再由大到小排序,最终的结果一定是两个数组各自的前1~M个,且无跳跃,分别都是连续的。那么假设我遍历大船的情况从0到船只数,意味着分别是有0个大船、1个大船、、、所有大船,剩余的费用给小船。在循环中记录每次的最大值及大船、小船的个数。

还有就是最后输出结果中第二行表示船的序号,另:G++ WA了 VC++ AC了

Description

A group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to the boat depot to take kayaks and catamarans to the point of departure. It's known that all kayaks are of the same size (and each of them occupies the space of 1 cubic metre), and all catamarans are of the same size, but two times bigger than kayaks (and occupy the space of 2 cubic metres).

Each waterborne vehicle has a particular carrying capacity, and it should be noted that waterborne vehicles that look the same can have different carrying capacities. Knowing the truck body volume and the list of waterborne vehicles in the boat depot (for each one its type and carrying capacity are known), find out such set of vehicles that can be taken in the lorry, and that has the maximum total carrying capacity. The truck body volume of the lorry can be used effectively, that is to say you can always put into the lorry a waterborne vehicle that occupies the space not exceeding the free space left in the truck body.

Input

The first line contains a pair of integer numbers n and v (1 ≤ n ≤ 1051 ≤ v ≤ 109), where n is the number of waterborne vehicles in the boat depot, and v is the truck body volume of the lorry in cubic metres. The following n lines contain the information about the waterborne vehicles, that is a pair of numbers ti, pi (1 ≤ ti ≤ 21 ≤ pi ≤ 104), where ti is the vehicle type (1 – a kayak, 2 – a catamaran), and pi is its carrying capacity. The waterborne vehicles are enumerated in order of their appearance in the input file.

Output

In the first line print the maximum possible carrying capacity of the set. In the second line print a string consisting of the numbers of the vehicles that make the optimal set. If the answer is not unique, print any of them.

Sample Input

Input
3 2
1 2
2 7
1 3
Output
7
2
#include <iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
struct ship
{
    int id,cost;
}ka[100000],ca[100000];
bool cmp(ship a,ship b)
{
    return a.cost>b.cost;
}
int total1[100000],total2[100000];
int n,v,sum[100000],t;
int main()
{
  // freopen("cin.txt","r",stdin);
    //freopen("cout.txt","w",stdout);
    while(~scanf("%d%d",&n,&v))
    {
        int num1=0,num2=0;
        for(int i=1;i<=n;i++) {
            scanf("%d",&t);
            if(t==1) {scanf("%d",&ka[num1].cost);ka[num1++].id=i;}
            else {scanf("%d",&ca[num2].cost);ca[num2++].id=i;}
        }
        sort(ka,ka+num1,cmp);
        //for(int i=0;i<num1;i++) printf("i=%d %d  ",ka[i].id,ka[i].cost);printf("\n");
        sort(ca,ca+num2,cmp);
        //for(int i=0;i<num2;i++) printf("i=%d %d  ",ca[i].id,ca[i].cost);printf("\n");
        int p1=0,p2=0,ans=0;
        total1[0]=0,total2[0]=0,total1[1]=ka[0].cost,total2[1]=ca[0].cost;
        for(int i=1;i<num1;i++) total1[i+1]=total1[i]+ka[i].cost;
        for(int i=1;i<num2;i++) total2[i+1]=total2[i]+ca[i].cost;
        int cnt=0,t,tmp,max0=-1,max1=-1,max2=-1;
        for(int i=0;i<=num2;i++)
        {
            if(i*2>v) break;
            t=v-i*2;
            if(t>num1) t=num1;
            if(total2[i]+total1[t]>max0)
            {
                max0=total2[i]+total1[t];
                max1=t;
                max2=i;
            }
        }
        printf("%d\n",max0);
        for(int i=0;i<max1;i++) printf("%d ",ka[i].id);
        for(int i=0;i<max2;i++) printf("%d ",ca[i].id);
        printf("\n");
    }
    return 0;
}


版权声明:⁄(⁄ ⁄•⁄ω⁄•⁄ ⁄)⁄hiahiahia 欢迎斧正 举报

相关文章推荐

Codeforces Beta Round #3——B. Lorry

题意: 现在告诉你有n个物品,背包的体积为V。 然后n行,有两种类型的物品,如果是1类型的物品,那么它的体积为1,如果是2类型的物品,那么它的体积为2。并同时告诉了我们每种物品的价值。 问你在不超过背...

codeforces 3B Lorry

B. Lorry time limit per test 2 seconds memory limit per test 64 megabytes input standard input...
  • ahoLic
  • ahoLic
  • 2014-03-28 12:29
  • 2036

我是如何成为一名python大咖的?

人生苦短,都说必须python,那么我分享下我是如何从小白成为Python资深开发者的吧。2014年我大学刚毕业..

Codeforces Beta Round #3 B. Lorry

一个贪心题写成这样也是醉了  ,这种状态注定要打酱油了么  ,不甘心啊~~ 题目大意: 一辆车可以承载体积V的货物,A种物品1个单位体积,B种2个单位体积,某种物品虽然体积相同但是能力却不相同。...

codeforces 3B. Lorry

给定卡车容量,及各物品所占体积和拥有价值,体积要么为1要么为2 贪心排序,最后一个要加进去的物品需要讨论多种情况 #include #include #include #include...

Codeforces 3B. Lorry

B. Lorry time limit per test 2 seconds memory limit per test 64 megabytes input standard input...

Codeforces 3B Lorry

EnglishDescA group of tourists is going to kayak and catamaran tour. A rented lorry has arrived to t...

CodeForces 3B Lorry

题目链接:http://codeforces.com/problemset/problem/3/B 问题的意思很是简单,

CF 3B Lorry

sort + greedy  为了满足各种判断条件 这样做应该是比较优的 全都用1的 全都用2的 1 2混合使用的 #include #include #include using nam...

codeforces373B+Anatoly and Cockroaches+贪心

Anatoly lives in the university dorm as many other students do. As you know, cockroaches are also li...

Codeforces Round #277 (Div. 2) A (水题)B(水题) C(贪心)

A. Calculating Function For a positive integer n let's define a function f: f(n) =  - 1 + 2 -...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)