MaximizeCapital.java

// import java.util.*;

// class MaximizeCapital {
//   public static int findMaximumCapital(int[] capital, int[] profits, int numberOfProjects, int initialCapital) {
//     // TODO: Write your code here
//     int size = profits.length;
//     PriorityQueue<Integer> minCapitalHeap = new PriorityQueue<>(size, (i1,i2)->capital[i1]-capital[i2]);
//     PriorityQueue<Integer> maxProfitHeap = new PriorityQueue<>(size, (i1,i2)->profits[i2]-profits[i1]);
//     for (int i = 0; i < size; i ++){
//       minCapitalHeap.add(i);
//     }
//     int result = initialCapital;
//     for (int i = 0; i < numberOfProjects; i ++){
//       while (!minCapitalHeap.isEmpty() && capital[minCapitalHeap.peek()] <= result){
//         maxProfitHeap.add(minCapitalHeap.poll());
//       }

//       if (maxProfitHeap.isEmpty()){
//         break;
//       }
//       result += profits[maxProfitHeap.poll()];
//     }
//     return result;
    
//   }

//   public static void main(String[] args) {
//     int result = MaximizeCapital.findMaximumCapital(new int[] { 0, 1, 2 }, new int[] { 1, 2, 3 }, 2, 1);
//     System.out.println("Maximum capital: " + result);
//     result = MaximizeCapital.findMaximumCapital(new int[] { 0, 1, 2, 3 }, new int[] { 1, 2, 3, 5 }, 3, 0);
//     System.out.println("Maximum capital: " + result);
//   }
// }