        for(int i = 0; i < blocks.length; i++) {
            pq.add(blocks[i]);
        }
        while(pq.size() > 1) {
            int x = pq.poll();
            int y = pq.poll();
            pq.offer(y + split);
        }
        return pq.poll();