✅ATM Machine (Contest)

ATM Machine (Contest) easy Time Limit: 2 sec Memory Limit: 128000 kB

Problem Statement :

There is an ATM machine. Initially, it contains a total of K units of money. N people (numbered 1 through N) want to withdraw money; for each valid i, the ith person wants to withdraw Ai units of money. The people come in and try to withdraw money one by one, in the increasing order of their indices. Whenever someone tries to withdraw money, if the machine has at least the required amount of money, it will give out the required amount. Otherwise, it will throw an error and not give out anything; in that case, this person will return home directly without trying to do anything else. For each person, determine whether they will get the required amount of money or not. Input The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows. The first line of each test case contains two space- separated integers N and K. The second line contains N space- separated integers A1, A2,. .. , A3.

Constraints 1 ≤ T ≤ 100 1 ≤ N ≤ 100 1 ≤ Ai ≤ 106 for each valid i 1 ≤ K ≤ 106

Output For each test case, print a single line containing a string with length N. For each valid i, the ith character of this string should be '1' if the ith person will successfully withdraw their money or '0' otherwise.

Example

Sample Input 2 5 10 3 5 3 2 1 4 6 10 8 6 4

Sample Output 11010 0010

link:https://my.newtonschool.co/playground/code/5tq34p64hciy/

import java.io.*; // for handling input/output
import java.util.*; // contains Collections framework

// don't change the name of this class
// you can add inner classes if needed
class Main {
    public static void main (String[] args) {
        // Your code here
        Scanner sc = new Scanner(System.in);
        int testCase = sc.nextInt();
        while(testCase != 0){
            int n = sc.nextInt();
            int k = sc.nextInt();

            for(int i=0;i<n;i++){
                int witdrawAmt = sc.nextInt();
                if(witdrawAmt <= k){
                    System.out.print(1);
                    k = k - witdrawAmt;
                } else {
                    System.out.print(0);
                }
            }
            System.out.println();
            testCase--;
        }
    }
}