private static void heapify(int l, int r, int[] pole) {
        int i=l;
        int j = 2*i;
        int p = pole[l];

        while(j<=r) {
            if(j<r)
                if(pole[j]<pole[j+1])
                    j++;
            if(p<pole[j]) {
                pole[i] = pole[j];
                i=j;
                j = 2*i;
            } else {
                break;
            }
            pole[i] = p;
        }
    }