Stack Challenge

#include
using namespace std;
// Function to return the total count.
int countTotalScore(int A[], int B[], int a, int b, int x){
    int index1 = 0, index2 = 0;
    int sum = 0, count;
    // calculate the sum of all elements in the array A till the sum is less than or equal to x.
    while(index1 < a && sum + A[index1] <= x){
        sum += A[index1];
        index1++;
    }
    // store the index of the last array traversed to mentain the total count.
    count = index1;
    // now, traverse the second array to get the total sum and count the total number of possibilities.
    while(index2 < b && index1 >= 0){
        sum += B[index2];
        index2++;
        // if the sum becomes greater than x then, keep reducing the sum from first array till it becomes less than x.
        while(sum > x && index1 > 0){
            index1--;
            sum -= A[index1];
        }
        // if sum is less than or equal to x and value of index1 + index2 is greater than total count, then update the count.
        if(sum <= x && (index1 + index2) > count)
            count = (index1 + index2);
    }
    // return the total count.
     return count;
}
// Driver function to check the above algorithm.
int main(){
    int t;
    cin>>t;
    while(t--){
        int a, b, x;
        cin>>a>>b>>x;
        int A[a], B[b];
        for(int i = 0; i < a; i++)
            cin>>A[i];
        for(int i = 0; i < b; i++)
            cin>>B[i];
        cout<
						 

import java.util.*;
  import java.io.*;
  public class Main {
   static int countTotalScore(int[] A, int B[], int a, int b, int x) {

         int index1 = 0, index2 = 0;
    int sum = 0, count;
    // calculate the sum of all elements in the array A 
    //till the sum is less than or equal to x.
    while(index1 < a && sum + A[index1] <= x){
        sum += A[index1];
        index1++;
    }
    // store the index of the last array traversed to mentain the 
    //total count.
    count = index1;
    // now, traverse the second array to get the total sum and 
    //count the total number of possibilities.
    while(index2 < b && index1 >= 0){
        sum += B[index2];
        index2++;
        // if the sum becomes greater than x then, keep reducing 
        //the sum from first array till it becomes less than x.
        while(sum > x && index1 > 0){
            index1--;
            sum -= A[index1];
        }
    // if sum is less than or equal to x and value of index1 + index2 
    //is greater than total count, then update the count.
        if(sum <= x && (index1 + index2) > count)
            count = (index1 + index2);
    }
    // return the total count.
     return count;
}
    public static void main(String args[]) throws IOException {
      Scanner sc=new Scanner(System.in);
        int t=sc.nextInt();
        while(t-- >0){
          int a,b,x;
          a=sc.nextInt();
          b=sc.nextInt();
          x=sc.nextInt();
          int[] A= new int[a];
          int[] B= new int[b];
          for(int i=0;i
						 

def countTotalScore(A, B, a, b, x):

    index1 = 0
    index2 = 0
    sum = 0

    while(index1 < a and sum + A[index1] <= x):

        sum += A[index1]
        index1 += 1

    count = index1

    while(index2 < b and index1 >= 0):

        sum += B[index2]
        index2 += 1

        while(sum > x and index1 > 0):

            index1 -= 1
            sum -= A[index1]

        if(sum <= x and (index1 + index2) > count):

            count = (index1 + index2)

    return count

for _ in range(int(input())):

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

	print(countTotalScore(A, B, a, b, x))
# your code goes here