堆中的路径

堆中的路径

 

 AC_Code:

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1010;
const int minn = -10001;

int Heap[maxn];
int _size;

void init(){
    _size = 0;
    Heap[_size] = minn;
}

void Insert(int x){
    int i;
    _size++;
    for(i=_size; Heap[i/2]>x; i/=2){
        Heap[i] = Heap[i/2];
    }
    Heap[i] = x;
}

void Print(int i){
    cout<<Heap[i]<<" ";
}


int main()
{
    int n,m; scanf("%d%d",&n,&m);
    init();
    for(int i=0;i<n;i++){
        int x; scanf("%d",&x);
        Insert(x);
    }
    for(int i=0;i<m;i++){
        int x; scanf("%d",&x);
        for( ;x>1;x/=2){
            Print(x);
        }
        cout<<Heap[1]<<endl;
    }
    return 0;
}