Codeforces Round 436 (Div. 2)
E
Fire
Codeforces
2000
原题
← DF →
翻译中…

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 $*t*_{*i*}$ seconds to save $*i*$-th item. In addition, for each item, he estimated the value of $*d*_{*i*}$ — the moment after which the item $*i*$ will be completely burned and will no longer be valuable for him at all. In particular, if $*t*_{*i*} ≥ *d*_{*i*}$, then $*i*$-th item cannot be saved.

翻译中…

Given the values $*p*_{*i*}$ 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 $*t*_{*a*}$ seconds, and the item $*b*$ — in $*t*_{*a*} + *t*_{*b*}$ 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 $*t*_{*i*}, *d*_{*i*}, *p*_{*i*}$ ($1 ≤ *t*_{*i*} ≤ 20$, $1 ≤ *d*_{*i*} ≤ 2 000$, $1 ≤ *p*_{*i*} ≤ 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.

翻译中…

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 $2$ seconds. 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 $3$ seconds, but this item will already be completely burned by this time.

翻译中…

样例

Input #1
3
3 7 4
2 6 5
3 7 6
Output #1
11
2
2 3
InputCopy OutputCopy
Input #2
2
5 6 1
3 3 5
Output #2
1
1
1
InputCopy OutputCopy
题目信息
题号
864E
时间限制
2 s
内存限制
256 MB
标签
动态规划
排序

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。