AtCoder Beginner Contest 172
翻译中…
Problem Statement
翻译中…
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 i \leq N)$, and $B_i$ minutes to read the $i$-th book from the top on Desk B $(1 \leq i \leq M)$.
翻译中…
Consider the following action:
翻译中…
- Choose a desk with a book remaining, read the topmost book on that desk, and remove it from the desk.
翻译中…
How many books can we read at most by repeating this action so that it takes us at most $K$ minutes in total? We ignore the time it takes to do anything other than reading.
翻译中…
Constraints
翻译中…
$1 \leq N, M \leq 200000$$1 \leq K \leq 10^9$$1 \leq A_i, B_i \leq 10^9$- All values in input are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N M K
A_1 A_2 \ldots A_N
B_1 B_2 \ldots B_M翻译中…
Output
翻译中…
Print an integer representing the maximum number of books that can be read.
翻译中…
样例
Input #1
3 4 240
60 90 120
80 150 80 150
Output #1
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.
Input #2
3 4 730
60 90 120
80 150 80 150
Output #2
7
Input #3
5 4 1
1000000000 1000000000 1000000000 1000000000 1000000000
1000000000 1000000000 1000000000 1000000000
Output #3
0
Watch out for integer overflows.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。