Haxpor

            /// <summary>
            /// Push an object onto the PQ
            /// </summary>
            /// <param name="O">The new object</param>
            /// <returns>The index in the list where the object is _now_. This will change when objects are taken from or put onto the PQ.
            /// If the object is already existed in the list then return -99.</returns>
            public int Push(object O)
            {
                int p = InnerList.Count, p2;
                if (CheckValueInList(O) == -1)
                    InnerList.Add(O); // E[p] = O
                else
                    return -99;  //return, we dont do anything
                do
                {
                    if (p == 0)
                        break;
                    p2 = (p - 1) / 2;
                    if (OnCompare(p, p2) &lt; 0)
                    {
                        SwitchElements(p, p2);
                        p = p2;
                    }
                    else
                        break;
                } while (true);
                return p;
            }

            // Check the existance of the specified object in the list,
            // if it's exist then return the index of the existed object, otherwise return -1
            int CheckValueInList(Object O)
            {
                //if no element
                if (InnerList.Count == 0)
                    return -1;
 
                //binary search
                int low = 0;
                int high = InnerList.Count - 1;
                int mid;
                while (low <= high)
                {
                    mid = low + (high - low) / 2;
                    if (Comparer.Compare(InnerList[mid], O) < 0)
                        high = mid - 1;
                    else if (Comparer.Compare(InnerList[mid], O) > 0)
                        low = mid + 1;
                    else
                        return mid; // found
                }
                return -1;
            }

            // Modify the code here to accommodate the type of data being compared.
            protected virtual int OnCompare(int i, int j)
            {
                return Comparer.Compare(InnerList[i], InnerList[j]);
            }

            // Modify the code here to accommodate the type of data being compared.
            protected virtual int OnCompare(int i, int j)
            {
                if(InnerList[i] is MyType && InnerList[j] is MyType)
               {
                      MyType obj1 = (MyType)InnerList[i];
                      MyType obj2 = (MyType)InnerList[j];
                      return Comparer.Compare(obj1, obj2);
                }
                //in this case only MyType type will be compared, otherwise return return
                return -99;
            }