comefrom: <gouthampradhan>greedy_MinimumTimeToBuildBlocks_1.java
code: public int minBuildTime(int[] blocks, int split) {
      PriorityQueue<Integer> queue = new PriorityQueue<>();
      for (int b : blocks) queue.offer(b);
      while (queue.size() != 1) {
        int a = queue.poll();
        int b = queue.poll();
        queue.offer(Math.max(a, b) + split);
      }
      return queue.poll();
    }
masked: public int sample_funcname ( int [ ] var_0 , int var_1 ) {
    PriorityQueue < Integer > var_4 = new PriorityQueue < > ( ) ;
    for ( int var_5 : var_0 ) var_4 . offer ( var_5 ) ;
    while ( var_4 . size ( ) != 1 ) {
      int var_10 = var_4 . poll ( ) ;
      int var_5 = var_4 . poll ( ) ;
      var_4 . offer ( Math . max ( var_10 , var_5 ) + var_1 ) ;
    }
    return var_4 . poll ( ) ;
  }
  