struct MaxHeap{
  vector<ElementType> Elements;
  int size;
  int cap;
  MaxHeap(int MaxSize):size(0),cap(MaxSize){
    Elements.resize(MaxSize);
  }

  bool IsFull() {return size == Elements.size();}
  bool IsEmpty() {return size == 0;}
  void Insert(ElementType item) {
    int i = ++size;
    for(;i/2 > 0 && Elements[i/2] < item;i/=2) {
      Elements[i] = Elements[i/2];
    }
    Elements[i] = item;
  }

  ElementType DeleteMax() {
    ElementType temp,MaxItem = Elements[1];
    int parent,child;
    
    temp = Elements[size--];
    for(parent = 1; parent*2 <= size;parent = child) {
      child = parent*2;
      if(child+1 <= size && Elements[child+1] > Elements[child]) child++;
      if(Elements[child] < temp) break;
      else Elements[parent] = Elements[child];
    }
    Elements[parent] = temp;
    return MaxItem;
  }
};