Problem:


Score : 300 points

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.

Sample Input 1

3 4 240
60 90 120
80 150 80 150

Sample 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.

Sample Input 2

3 4 730
60 90 120
80 150 80 150

Sample Output 2

7

Sample Input 3

5 4 1
1000000000 1000000000 1000000000 1000000000 1000000000
1000000000 1000000000 1000000000 1000000000

Sample Output 3

0

Watch out for integer overflows.



Sample input:
3 4 240
60 90 120
80 150 80 150


Sample output:
3

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

a = a[::-1]
b = b[::-1]
ans = 0
now = k

while (0 < k):
    if a and b:
        if a[-1] < b[-1]:
            now -= a.pop()
        else:
            now -= b.pop()
    elif a:
        now -= a.pop()
    elif b:
        now -= b.pop()
    else:
        break
    if now < 0:
        break
    ans += 1
    k -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

a = a[::-1]
b = b[::-1]
ans = 0
now = k

while (0 <= k):
    if a and b:
        if a[-1] < b[-1]:
            now -= a.pop()
        else:
            now -= b.pop()
    elif a:
        now -= a.pop()
    elif b:
        now -= b.pop()
    else:
        break
    if now < 0:
        break
    ans += 1
    k -= 1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

ab = a + b
ab.sort()
ans = 0
now = k
for elem in ab:
    now -= elem
    if now < 0:
        break
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
import os
import operator
from collections import defaultdict
import sys
from io import BytesIO, IOBase
import bisect

# def power(x, p):
#     res = 1
#     while p:
#         if p & 1:
#             res = res * x % 1000000007
#         x = x * x % 1000000007
#         p >>= 1
#     return res;

def main():
    n,m,k=map(int,input().split())
    A=[int(k) for k in input().split()]
    B=[int(k) for k in input().split()]
    a=[0]
    b=[0]
    for i in range(n):
        a.append(a[i]+A[i])
    for i in range(m):
        b.append(b[i]+B[i])
    ans=0
    j=m
    for i in range(n+1):
        if a[i]>k:
            break
        while b[j]>k-a[i]:
            j-=1
        ans=max(ans,i+j)
        print(i,j)
    print(ans)

    # for _ in range(int(input())):
        # n=int(input())
        # arr=[int(k) for k in input().split()]
        # odd=[]
        # even=[]
        # for i in range(2*n):
        #     if arr[i]%2==0:
        #         even.append(i+1)
        #     else:
        #         odd.append(i+1)
        # if len(odd)%2!=0 and len(even)%2!=0:
        #     odd.pop()
        #     even.pop()
        #     for i in range(0,len(odd),2):
        #         print(odd[i],odd[i+1])
        #     for i in range(0,len(even),2):
        #         print(even[i],even[i+1])
        # else:
        #     if len(odd)!=0 and len(even)!=0:
        #         odd.pop()
        #         odd.pop()
        #         for i in range(0, len(odd), 2):
        #             print(odd[i], odd[i + 1])
        #         for i in range(0, len(even), 2):
        #             print(even[i], even[i + 1])
        #     else:
        #         for i in range(0,2*n-2,2):
        #             print(i+1,i+2)








BUFSIZE = 8192

class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
(n,m,k) = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

sum = 0 
i,j=0,0
count = 0
while(sum<=k and i!=n and j!=m):
    if a[i]>b[j]:
        sum+=b[j]
        j+=1 
    elif a[i]==b[j]:
        if i<n-1 and j<m-1:
            if a[i+1] < b[j+1]:
                sum+=a[i]
                i+=1
            else:
                sum+=b[j]
                j+=1
        else:
            if i==n-1:
                sum+=b[j]
                j+=1 
            else:
                sum+=a[i]
                i+=1 
    else:
        sum+=a[i]
        i+=1
    if sum > k:
        break 
    count+=1 
    # print(sum,count)

if sum<=k:
    if i == n:
        while(j!=m and sum+b[j]<=k):
            sum+=b[j]
            j+=1
            count+=1  
    else:
        while(i!=n and sum+a[i]<=k):
            sum+=a[i]
            i+=1
            count+=1 
print(count)

Submission status: Wrong Answer

Solution code:
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))

a = [A[0]]
b = [B[0]]

for i in range(len(A)):
  if i > 0:
    a.append(A[i-1]+A[i])
    
for i in range(len(B)):
  if i > 0:
    b.append(B[i-1]+B[i])
    
max = 0

for i in range(len(a)):
  for j in range(len(b)):
    if a[i]+b[j] <= K and i+j+2 > max:
      max = i+j+2
      
print(max)

Submission status: Wrong Answer

Solution code:
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
AS ,BS = [0], [0]
for a in A:
  AS.append(AS[-1] + a)
for b in B:
  BS.append(BS[-1] + b)
p,q = 0,0
T = 0
ret = 0
for i in range(N):
  K_ = K
  K_ -= AS[i]
  if K_ == 0:
    ret = max(ret,i)
    break
  elif K_ < 0:
    ret = max(ret, i - 1)
    break
  for j in range(M):
    K_2 = K_
    K_2 -= BS[j]
    if K_2 == 0:
      tmp = i + (j + 1)
      ret = max(ret, tmp)
      break
    elif K_2 < 0:
      tmp = i + j
      ret = max(ret, tmp)
      break
print(ret)

Submission status: Wrong Answer

Solution code:
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
p,q = 0,0
T = 0
ret = 0
for i in range(N):
  K_ = K
  K_ -= sum(A[:i])
  if K_ == 0:
    ret = max(ret,i)
    break
  elif K_ < 0:
    ret = max(ret, i - 1)
    break
  for j in range(M):
    K_ -= B[j]
    if K_ == 0:
      tmp = i + (j + 1)
      ret = max(ret, tmp)
      break
    elif K_ < 0:
      tmp = i + j
      break
print(ret)

Submission status: Wrong Answer

Solution code:
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
p,q = 0,0
T = 0
ret = 0
for i in range(N):
  K_ = K
  K_ -= sum(A[:i])
  for j in range(M):
    K_ -= B[j]
    if K_ == 0:
      tmp = i + (j + 1)
      ret = max(ret, tmp)
      break
    elif K_ < 0:
      tmp = i + j
      break
print(ret)

Submission status: Wrong Answer

Solution code:
N,M,K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
p,q = 0,0
T = 0
while True:
  if p < N and q < M:
    if A[p] < B[q]:
      T += A[p]
      p += 1
    else:
      T += B[q]
      q += 1
    if T == K:
      ret =  p + q 
      break
    if T > K:
      ret = p + q - 1
      break
  elif p >= N and q >= M:
    ret = N + M
    break

  else:
    if p < N:
      T += A[p]
      q += 1
    else:
      T += B[q]
      q += 1
    if T == K:
      ret = p + q 
      break
    if T > K:
      ret = p + q - 1
      break

print(ret)

Submission status: Wrong Answer

Solution code:
n,m,k = map(int,input().split())

a = list(map(int,input().split()))
b = list(map(int,input().split()))

s = 0
t = 0
for i in range(n+m):

    c = min(a[0],b[0])
    if k-c <= s:
        break
    else:
        s += c
        t += 1
print(t)

Submission status: Wrong Answer

Solution code:
import bisect
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]

honn=bisect.bisect(B,K)
print(honn)
for i in range(len(A)):
    s=K-A[i]
    if s>=0:
        
        a=bisect.bisect(B,s)
        #print(s)
        if i+1+a>honn:
            honn=i+1+a
print(honn)

Submission status: Wrong Answer

Solution code:
import bisect
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]
honn=0
for i in range(len(A)):
    s=K-A[i]
    if s>=0:
        
        a=bisect.bisect(B,s)
        #print(s)
        if i+1+a>honn:
            honn=i+1+a
print(honn)

Submission status: Wrong Answer

Solution code:
import bisect
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]
honn=0
for i in range(len(A)):
    s=K-A[i]
    a=bisect.bisect(B,s)
    #print(s)
    if i+1+a>honn:
        honn=i+1+a
print(honn)

Submission status: Wrong Answer

Solution code:
import bisect
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]
honn=0
for i in range(len(A)):
    s=K-A[i]
    a=bisect.bisect(B,s)
    print(s)
    if i+1+a>honn:
        honn=i+1+a
print(honn)

Submission status: Wrong Answer

Solution code:
from collections import deque
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]
A=A+[0]*M
B=B+[0]*N
A=deque(A)
B=deque(B)
a=0
b=0
honn=0
for i in range(N+M):
    if A[0]!=0 and B[0]!=0:
        if A[0]<B[0]:
            a=A.popleft()
            if a+b<=K:
                honn+=1
                continue
            else:
                break
        elif A[0]>=B[0]:
            b=B.popleft()
            if a+b<=K:
                honn+=1
                continue
            else:
                break
    elif A[0]==0 and B[0]!=0:
        b=B.popleft()
        if a+b<=K:
            honn+=1
            continue
        else:
            break
    elif B[0]==0 and A[0]!=0:
        a=A.popleft()
        if a+b<=K:
            honn+=1
            continue
        else:
            break
            
    elif A[0]==0 and B[0]==0:
      break
print(honn)

Submission status: Wrong Answer

Solution code:
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]
A=A+[0]*M
B=B+[0]*N
a=0
b=0
honn=0
for i in range(N+M):
    if A[0]!=0 and B[0]!=0:
        if A[0]<B[0]:
            a=A.pop(0)
            if a+b<=K:
                honn+=1
                continue
            else:
                break
        elif A[0]>=B[0]:
            b=B.pop(0)
            if a+b<=K:
                honn+=1
                continue
            else:
                break
    elif A[0]==0 and B[0]!=0:
        b=B.pop(0)
        if a+b<=K:
            honn+=1
            continue
        else:
            break
    elif B[0]==0 and A[0]!=0:
        a=A.pop(0)
        if a+b<=K:
            honn+=1
            continue
        else:
            break
            
    elif A[0]==0 and B[0]==0:
        break
print(honn)

Submission status: Wrong Answer

Solution code:
import sys
import re
try:
  t = input().split(' ')
  N = int(t[0])
  M = int(t[1])
  K = int(t[2])
  S = 0
  A = [int(n) for n in input().split(' ')]
  B = [int(n) for n in input().split(' ')]
  if not 1 <= N <= 200000 or not 1 <= M <= 200000 or not 1 <= K <= (10**9):
    sys.exit()

  C = N if M < N else M
  BC = 0
  for l in range(C):
    TT = 0
    if l+1 <= N:
      if not 1 <= A[l] <= (10**9):
        sys.exit()
      S += A[l]
      BC += 1
      if not S <= K:
        BC -= 1
        break
    if l+1 <= M:
      if not 1 <= B[l] <= (10**9):
        sys.exit()
      S += B[l]
      BC += 1
      TT += 1
      if not S <= K:
        BC -= 1
        break
  print(BC)
except Exception as err:
  sys.exit()

Submission status: Wrong Answer

Solution code:
N,M,K = map(int, input().split())
A= list(map(int, input().split()))
B = list(map(int, input().split()))
for i in range(1,len(A)):
    A[i]+=A[i-1]
for i in range(1,len(B)):
    B[i]+=B[i-1]
A=A+[0]*M
B=B+[0]*N
a=0
b=0
honn=0
for i in range(N+M):
    if A[0]!=0 and B[0]!=0:
        if A[0]<B[0]:
            a=A.pop(0)
            if a+b<=K:
                honn+=1
                continue
            else:
                break
        elif A[0]>=B[0]:
            b=B.pop(0)
            if a+b<=K:
                honn+=1
                continue
            else:
                break
    elif A[0]==0 and B[0]!=0:
        b=B.pop(0)
        if a+b<=K:
            honn+=1
            continue
        else:
            break
    elif B[0]==0 and A[0]!=0:
        a=A.pop(0)
        if a+b<=K:
            honn+=1
            continue
        else:
            break
print(honn)

Submission status: Wrong Answer

Solution code:
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
if sum(a)+sum(b)<=k:
    print(n+m)
    exit()
num = 0
cnt = -1
for i in range(n+m):
    if num>k:
        break
    elif a == [] and b == []:
        break
    elif a == []:
        num += b[0]
        cnt +=1
        del b[0]
    elif b == []:
        num += a[0]
        cnt += 1
        del a[0]
    elif a[0] <= b[0]:
        num += a[0]
        cnt += 1
        del a[0]
    else:
        num += b[0]
        cnt += 1
        del b[0]
print(cnt)

Submission status: Wrong Answer

Solution code:
import collections as cc
import itertools as it
I=lambda:list(map(int,input().split()))
n,m,k=I()
a=I()
b=I()
i=0
j=0
ans=0
su=0
while i<len(a) and j<len(b):
	if a[i]<b[j]:
		su+=a[i]
		i+=1
	else:
		su+=b[j]
		j+=1
	if su<=k:
		ans+=1
while i<len(a):
	su+=a[i]
	if su<=k:
		ans+=1
	else:
		break
	i+=1
while j<len(b):
	su+=b[j]
	if su<=k:
		ans+=1
	else:
		break
	j+=1
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split())) + [float('inf')]
b = list(map(int, input().split())) + [float('inf')]
c = [0]
i, j = 0, 0
while i+j < n+m+1:
    if a[i]<b[j]:
        c.append(c[-1]+a[i])
        i += 1
        if i == n:
            i = n
    else:
        c.append(c[-1]+b[j])
        j += 1
        if j == m:
            j = m
    if c[-1] > k:
        break
print(i+j-1)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split())) + [float('inf')]
b = list(map(int, input().split())) + [float('inf')]
c = [0]
i, j = 0, 0
while i+j < n+m+1:
    if a[i]<b[j]:
        c.append(c[-1]+a[i])
        i += 1
        if i == n:
            i = n
    else:
        c.append(c[-1]+b[j])
        j += 1
        if j == m:
            j = m
right, left = len(c), 0
while left < right:
    middle = (left+right)//2
    if k == c[middle]:
        right = middle + 1
        break
    elif k < c[middle]:
        right = middle
    else:
        left = middle + 1
print(right-1)

Submission status: Wrong Answer

Solution code:
import collections as cc
import itertools as it
I=lambda:list(map(int,input().split()))
n,m,k=I()
a=I()+I()
a.sort()
su=0
ans=0
for i in range(len(a)):
	su+=a[i]
	if su<=k:
		ans+=1
	else:
		break
print(ans)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split())) + [float('inf')]
b = list(map(int, input().split())) + [float('inf')]
c = [0]
i, j = 0, 0
while i+j <= n+m:
    if a[i]<b[j]:
        c.append(c[-1]+a[i])
        i += 1
    else:
        c.append(c[-1]+b[j])
        j += 1
right, left = len(c), 0
while left < right:
    middle = (left+right)//2
    if k == c[middle]:
        right = middle + 1
        break
    elif k < c[middle]:
        right = middle
    else:
        left = middle + 1
print(right-1)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split())) + [float('inf')]
b = list(map(int, input().split())) + [float('inf')]
c = [0]
i, j = 0, 0
while i+j <= n+m:
    if a[i]<b[j]:
        c.append(c[-1]+a[i])
        i += 1
    else:
        c.append(c[-1]+b[j])
        j += 1
right, left = len(c), 0
while left < right:
    middle = (left+right)//2
    if c[middle] <= k:
        left = middle + 1
    else:
        right = middle
print(right-1)

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
	inp=stdin.readline
	n,m,k=map(int, inp().split())
	a=list(map(int, inp().split()))
	b=list(map(int, inp().split()))
	
	ac,bc,x,y,tot,temp=0,0,0,0,0,0
	inf=10**9+7
	ans=0
	
	while True:
		x=inf if ac>=n else a[ac]
		y=inf if bc>=m else b[bc]
		
		if x==y and x==inf:
			break
		if x<y:
			temp=a[ac]
			ac+=1
		else:
			temp=b[bc]
			bc+=1
		
		if temp+tot<=k:
			ans+=1
			tot+=temp
		else:
			break

	print(ans)

main()

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sum = 0
c = 0
for i in range(n+m):
  if len(a) and len(b) and a[0] < b[0]:
    sum += a.pop(0)
  elif len(b):
    sum += b.pop(0)
  else:
    sum += a.pop(0)
  if sum <= k:
    c += 1
print(c)

Submission status: Wrong Answer

Solution code:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
l = []
sum = 0
c = 0
for i in range(n+m):
  if i % 2 == 0 and len(a):
    sum += a.pop(0)
  elif len(b):
    sum += b.pop(0)
  if sum <= k:
    c += 1
  else:
    break
print(c)

Submission status: Wrong Answer

Solution code:
nmk = list(map(int,input().split()))

desk_a = list(map(int,input().split()))
desk_b = list(map(int,input().split()))
read_time = 0
n = nmk[0]
m = nmk[1]
k = nmk[2]

if len(desk_a) >= len(desk_b):
    minbook = len(desk_b)
    maxbook = len(desk_a)
    maxdesk = desk_a
else:
    minbook = len(desk_a)
    maxbook = len(desk_b)
    maxdesk = desk_b

for i in range(minbook):
    if read_time <= k:
        if desk_a[i] >= desk_b[i]:
            read_book = desk_b[i]
        else:
            read_book = desk_a[i]
        read_time += read_book
        books = i
    else:
        books = i-1

for i in range(len(maxdesk)):
    if read_time <= k:
        read_time += maxdesk[maxbook - minbook]
        books = i
    else:
        books = i - 1

print(books+1)

Submission status: Wrong Answer

Solution code:
N,M,K=[int(i) for i in input().split()]
As=[int(i) for i in input().split()]
Bs=[int(i) for i in input().split()]

T=0
NUM=0

while T<K:
    if len(As)==0:
        if len(Bs)==0:
            NUM+=1
            break
        else:
            T+=Bs[0]
            Bs=Bs[1:]
            NUM+=1
    elif len(Bs)==0:
        T+=As[0]
        As=As[1:]
        NUM+=1
    else:
        if As[0]<Bs[0]:
            T+=As[0]
            As=As[1:]
            NUM+=1
        else:
            T+=Bs[0]
            Bs=Bs[1:]
            NUM+=1
                    
            
print(NUM+(-1 if T>K else 0))

Submission status: Wrong Answer

Solution code:
from collections import Counter, defaultdict

BS="0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"
def to_base(s, b):
    res = ""
    while s:
        res+=BS[s%b]
        s//= b
    return res[::-1] or "0"
alpha = "abcdefghijklmnopqrstuvwxyz"
from math import floor, ceil,pi

primes = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919
]
def primef(n, plst = []):
    if n==1:
        return plst
    else:
        for m in primes:
            if n%m==0:
                return primef(n//m, plst+[m])
        return primef(1, plst+[n])

def lmii():
    return list(map(int, input().split()))

def ii():
    return int(input())

def countOverlapping(string,sub):
    count = start = 0
    while True:
        start = string.find(sub, start)+1
        if start > 0:
            count += 1
        else:
            return count

from copy import deepcopy
n,m,k = lmii()
ai = lmii()
bi = lmii()
c = 0
tot = 0
while ai or bi:
    if ai:
        a = ai.pop(0)
    else:
        a = None
    if bi:
        b = bi.pop(0)
    else:
        b = None

    if a is None:
        if tot+b <= k:
            tot += b
            c += 1
            continue
        else:
            break
    if b is None:
        if tot+a <= k:
            tot += a
            c += 1
            continue
        else:
            break



    if a < b:
        if tot+a <= k:
            tot += a
            c += 1
            bi.insert(0, b)
        else:
            break
    else:
        if tot+b <= k:
            tot += b
            c += 1
            ai.insert(0, a)
        else:
            break

print(c)

Submission status: Wrong Answer

Solution code:
nmk = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))

a = [A[0]]
a_n = A[0]
for i in range(1, nmk[0]):
    a_n += A[i]
    a.append(a_n)

b = [B[0]]
b_n = B[0]
for i in range(1, nmk[1]):
    b_n += B[i]
    b.append(b_n)

ans = 0
best = nmk[1]-1
for i in range(nmk[0]):
    if nmk[2]<a[i]:
        break
    for j in range(best, -1, -1):
        if nmk[2]>=a[i]+b[j]:
            ans = (i+1)+(j+1) if ans<(i+1)+(j+1) else ans
            best = j
            break

print(ans)

Submission status: Wrong Answer

Solution code:
import numpy as np

def main():
  n,m,k=map(int,input().split())
  a=list(map(int,input().split()))
  b=np.array(list(map(int,input().split())))
  #a=np.cumsum(a)
  b=np.cumsum(b)
  k0=k+1
  #a0=np.searchsorted(a,k)
  b0=np.searchsorted(b,k)
  r=b0
  i=0
  for i, ia in enumerate(a):
    k0=k0-ia
    #print(k0)
    if k0<=0:
      break
    b0=np.searchsorted(b,k0)
    b0+=i+1
    if b0 > r:
      r=b0
  print(r)
main()

Submission status: Wrong Answer

Solution code:
import numpy as np

def main():
  n,m,k=map(int,input().split())
  a=list(map(int,input().split()))
  b=np.array(list(map(int,input().split())))
  b=np.cumsum(b)
  k0=k+1
  b0=np.searchsorted(b,k)
  r=b0
  i=0
  for i, ia in enumerate(a):
    k0=k0-ia
    if k0<0:
      break
    b0=np.searchsorted(b,k0)
    b0+=i+1
    if b0 > r:
      r=b0
  print(r)
main()

Submission status: Wrong Answer

Solution code:
N,M,K = input().split()

N = int(N)
M = int(M)
K = int(K)

A = list(input().split())
A = [int(c) for c in A]

B = list(input().split())
B = [int(c) for c in B]

i = 0
j = 0

while j < K:
    if len(A) == 0 and len(B) == 0:
        break
    elif len(A) == 0:
        if j + B[0] <= K:
            j += B[0]
            B = B[1:]
            i += 1
        else:
            break
    elif len(B) == 0:
        if j + A[0] <= K:
            j += A[0]
            A = A[1:]
            i += 1
        else:
            break
    else:
        if A[0] < B[0]:
            if j + A[0] <= K:
                j += A[0]
                A = A[1:]
                i += 1
            else:
                break
        else:
            if j + B[0] <= K:
                j += B[0]
                B = B[1:]
                i += 1
            else:
                break

print(i)

Submission status: Wrong Answer

Solution code:
grid = []
for i in range(3):
    array = list(map(int, input().strip().split()))
    grid.append(array)


K = grid[0][2]
count = 0
target = 0
while K > 0:
    if len(grid[1]) == 0 and len(grid[2]) == 0:
        break
    elif len(grid[1]) == 0:
        if K < grid[2][0]:
            break
        K -= grid[2][0]
        grid[2].pop(0)
    elif len(grid[2]) == 0:
        if K < grid[1][0]:
            break
        K -= grid[1][0]
        grid[1].pop(0)
    else:
        if grid[1][0] < grid[2][0]:
            if K < grid[1][0]:
                break
            K -= grid[1][0]
            grid[1].pop(0)
        else:
            if K < grid[2][0]:
                break
            K -= grid[2][0]
            grid[2].pop(0)
    count += 1
print(count)