Codeforces 864E Fire【排序+背包dp】

E. Fire

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Polycarp is in really serious trouble — his house is on fire! It's time to save the most valuable items. Polycarp estimated that it would take tiseconds to save i-th item. In addition, for each item, he estimated the value of di — the moment after which the item i will be completely burned and will no longer be valuable for him at all. In particular, if ti ≥ di, then i-th item cannot be saved.

Given the values pi for each of the items, find a set of items that Polycarp can save such that the total value of this items is maximum possible. Polycarp saves the items one after another. For example, if he takes item a first, and then item b, then the item a will be saved in ta seconds, and the item b — in ta + tb seconds after fire started.

Input

The first line contains a single integer n (1 ≤ n ≤ 100) — the number of items in Polycarp's house.

Each of the following n lines contains three integers ti, di, pi (1 ≤ ti ≤ 20, 1 ≤ di ≤ 2 000, 1 ≤ pi ≤ 20) — the time needed to save the item i, the time after which the item i will burn completely and the value of item i.

Output

In the first line print the maximum possible total value of the set of saved items. In the second line print one integer m — the number of items in the desired set. In the third line print m distinct integers — numbers of the saved items in the order Polycarp saves them. Items are 1-indexed in the same order in which they appear in the input. If there are several answers, print any of them.

Examples

input

33 7 42 6 53 7 6

output

1122 3 

input

25 6 13 3 5

output

111 

Note

In the first example Polycarp will have time to save any two items, but in order to maximize the total value of the saved items, he must save the second and the third item. For example, he can firstly save the third item in 3 seconds, and then save the second item in another 2seconds. Thus, the total value of the saved items will be 6 + 5 = 11.

In the second example Polycarp can save only the first item, since even if he immediately starts saving the second item, he can save it in 3seconds, but this item will already be completely burned by this time.

题目大意：

给出N个物品，每个物品拿取需要ti时间，di之间之后这个物品就不能拿了，物品的价值为pi，问怎样拿能够拿最多价值的物品，问这些物品拿取的顺序。

思路：

我们将物品按照截止时间di排序然后跑背包Dp即可。

设定Dp【i】【j】表示到第i个物品，到了时间j能够拿取的最多物品。

同时维护Back【i】【j】表示到当前状态，最后拿的物品的编号。

然后得到最大值之后，倒序找到顺序即可。

Ac代码：

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>#include<vector>#include<map>using namespace std;struct node{    int ned,d,val,id;}a[1500];vector<int >ans;int cmp(node a,node b){    return a.d<b.d;}int dp[150][2500];int last[150][2500];int main(){    int n;    while(~scanf("%d",&n))    {        for(int i=1;i<=n;i++)scanf("%d%d%d",&a[i].ned,&a[i].d,&a[i].val),a[i].id=i;        sort(a+1,a+1+n,cmp);        memset(dp,0,sizeof(dp));        memset(last,0,sizeof(last));        for(int i=1;i<=n;i++)        {            for(int j=1;j<=2000;j++)            {                dp[i][j]=dp[i-1][j];                if(j>=a[i].ned&&j<a[i].d)                {                    if(dp[i-1][j-a[i].ned]+a[i].val>dp[i][j])                    {                        dp[i][j]=dp[i-1][j-a[i].ned]+a[i].val;                        last[i][j]=i;                    }                }            }        }        int output=0,pos;        for(int i=1;i<=2000;i++)        {            if(output<dp[n][i])            {                output=dp[n][i];                pos=i;            }        }        printf("%d\n",output);        int level=n;ans.clear();        while(pos>0&&level>0)        {          if(last[level][pos]>0)            ans.push_back(a[last[level][pos]].id);            pos-=a[last[level][pos]].ned;            level--;        }        reverse(ans.begin(),ans.end());        printf("%d\n",ans.size());        for(int j=0;j<ans.size();j++)        {            printf("%d ",ans[j]);        }        printf("\n");    }}