# -----CodeForces 3B Lorry-----贪心-------

B - Lorry
Time Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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 <algorithm>
#include <stdio.h>
using namespace std;
struct sa
{
int id;
int val;
} one[100005],two[100005];
int cmp(const sa &a,const sa &b)
{
return a.val>b.val;
}
int sum1[100005],sum2[100005];
int main()
{

int n,v;
while(scanf("%d%d", &n, &v) != EOF)
{
int kind,val;
int one_num=0,two_num=0;
for(int i=1; i<=n; i++)
{
scanf("%d%d",&kind,&val);
if(kind==1)
{
one[++one_num].val=val;
one[one_num].id=i;
}
else
{
two[++two_num].val=val;
two[two_num].id=i;
}
}
sort(one+1,one+one_num+1,cmp);
sort(two+1,two+two_num+1,cmp);
//int sum1[100005],sum2[100005];
sum1[0]=0;
sum2[0]=0;
for(int i=1; i<=one_num; i++)
{
sum1[i]=sum1[i-1]+one[i].val;
}
for(int i=1; i<=two_num; i++)
{
sum2[i]=sum2[i-1]+two[i].val;
}
int maxv=-1,io=0,it=0;
for(int i=0; i<=one_num; i++)
{
if(i>v)
break;
int d=sum1[i]+sum2[min((v-i)/2,two_num)];
if(d>maxv)
{
maxv=d;
io=i;
it=min((v-i)/2,two_num);
}
}
if(maxv==-1)
{
cout<<"0"<<endl;
continue;
}
cout<<maxv<<endl;
int num[100005];
int cnt=0;
for(int i=1; i<=io; i++)
num[++cnt]=one[i].id;
for(int i=1; i<=it; i++)
num[++cnt]=two[i].id;
for(int i=1; i<=cnt; i++)
printf("%d%c", num[i], i == cnt? '\n' : ' ');

}
return 0;
}

• 本文已收录于以下专栏：

## codeforces 3B Lorry

B. Lorry time limit per test 2 seconds memory limit per test 64 megabytes input standard input...
• ahoLic
• 2014年03月28日 12:29
• 2186

## codeforces 3B (贪心)

• u014679804
• 2015年03月30日 22:25
• 435

## codeforces 3B Lorry 贪心

• yan_____
• 2012年12月07日 15:47
• 637

## Codeforces 3B Lorry 贪心

• llkpersonal
• 2013年08月20日 14:13
• 437

## codeforces 276D 贪心

D. Little Girl and Maximum XOR time limit per test 2 seconds memory limit per test 256 m...
• liyunlong41
• 2016年05月16日 13:50
• 350

## CodeForces 3B Lorry 贪心

• zhou_yujia
• 2015年07月10日 09:24
• 657

## Codeforces 910C Minimum Sum

• computer_user
• 2018年01月02日 21:20
• 80

## CodeForces 287B 二分贪心

Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ult...
• u011217342
• 2013年10月18日 09:58
• 1336

## CodeForces 137C【贪心+优先队列】

• KEYboarderQQ
• 2017年03月23日 00:09
• 169

## CodeForces - 840A Leha and Function（贪心）

• qq_36306833
• 2017年08月19日 19:03
• 172

举报原因： 您举报文章：-----CodeForces 3B Lorry-----贪心------- 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)