comefrom: <gouthampradhan>greedy_ReducingDishes_1.java
code: public int maxSatisfaction(int[] satisfaction) {
      Queue<Integer> pq = new PriorityQueue<>(((o1, o2) -> o2 - o1));
      Arrays.stream(satisfaction).forEach(pq::offer);
      int max = 0, sum = 0;
      while (!pq.isEmpty()) {
        if ((max + sum) >= max) {
          max += sum;
          sum += pq.poll();
        } else break;
      }
      return max;
    }
masked: public int sample_funcname ( int [ ] var_0 ) {
    Queue < Integer > var_3 = new PriorityQueue < > ( ( ( var_1 , var_2 ) -> var_2 - var_1 ) ) ;
    Arrays . stream ( var_0 ) . forEach ( var_3 :: offer ) ;
    int var_4 = 0 , var_5 = 0 ;
    while ( ! var_3 . isEmpty ( ) ) {
      if ( ( var_4 + var_5 ) >= var_4 ) {
        var_4 += var_5 ;
        var_5 += var_3 . poll ( ) ;
      }
      else break ;
    }
    return var_4 ;
  }
  