堆－heap

#include <vector>
#include <cstdio>
using namespace std;
class Heap {

private :
    vector<int> data;
    void reBuildHead();
    void reBuildTail();
public:
    Heap(){}
    ~Heap(){}
    int pop();
    int top();
    void push(int value);
};
void Heap::reBuildHead(){
    int now = ;
    while(true) {
        int lson = now << ;
        int rson = now <<  | ;
        if (lson >= data.size()) break;
        int target = rson >= data.size() ? lson : (data[lson] < data[rson] ? rson : lson);
        if (data[now] < data[target]) {
            swap(data[now], data[target]);
            now = target;
        } else {
            break;
        }
    }
}
void Heap::reBuildTail(){
    int now = this -> data.size() - ;
    while(true) {
        if (now == ) break;
        int father = now >> ;
        if (data[now] > data[father]) {
            swap(data[now], data[father]);
            now = father;
        } else {
            break;
        }
    }
}
int Heap::pop() {
    if (data.size() == ) return NULL;
    int ans = data[];
    data[] = data [data.size() -];
    data.pop_back();
    this -> reBuildHead();
    return ans;
}
int Heap::top() {
    return data.size() ==  ? NULL : data[];
}
void Heap::push(int value) {
    data.push_back(value);
    this -> reBuildTail();
}