3 4 240 60 90 120 80 150 80 150
3 In this case, it takes us $60$, $90$, $120$ minutes to read the $1$\-st, $2$\-nd, $3$\-rd books from the top on Desk A, and $80$, $150$, $80$, $150$ minutes to read the $1$\-st, $2$\-nd, $3$\-rd, $4$\-th books from the top on Desk B, respectively. We can read three books in $230$ minutes, as shown below, and this is the maximum number of books we can read within $240$ minutes. * Read the topmost book on Desk A in $60$ minutes, and remove that book from the desk. * Read the topmost book on Desk B in $80$ minutes, and remove that book from the desk. * Read the topmost book on Desk A in $90$ minutes, and remove that book from the desk.
3 4 730 60 90 120 80 150 80 150
7
5 4 1 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000 1000000000
0 Watch out for integer overflows.
{
"problem": {
"name": "Tsundoku",
"description": {
"content": "We have two desks: A and B. Desk A has a vertical stack of $N$ books on it, and Desk B similarly has $M$ books on it. It takes us $A_i$ minutes to read the $i$\\-th book from the top on Desk A $(1 \\leq",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc172_c"
},
"statements": [
{
"statement_type": "Markdown",
"content": "We have two desks: A and B. Desk A has a vertical stack of $N$ books on it, and Desk B similarly has $M$ books on it.\nIt takes us $A_i$ minutes to read the $i$\\-th book from the top on Desk A $(1 \\leq...",
"is_translate": false,
"language": "English"
}
]
}