c#---优先队列

转自
http://blog.csdn.net/luke2834/article/details/51154283

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace PriorityQueue
{
    public class PriorityQueue<T>
    {
        IComparer<T> comparer;
        T[] heap;

        public int Count { get; private set; }

        public PriorityQueue() : this(null) { }
        public PriorityQueue(int capacity) : this(capacity, null) { }
        public PriorityQueue(IComparer<T> comparer) : this(16, comparer) { }

        public PriorityQueue(int capacity, IComparer<T> comparer)
        {
            this.comparer = (comparer == null) ? Comparer<T>.Default : comparer;
            this.heap = new T[capacity];
        }

        public void Push(T v)
        {
            if (Count >= heap.Length) Array.Resize(ref heap, Count * 2);
            heap[Count] = v;
            SiftUp(Count++);
        }

        public T Pop()
        {
            var v = Top();
            heap[0] = heap[--Count];
            if (Count > 0) SiftDown(0);
            return v;
        }

        public T Top()
        {
            if (Count > 0) return heap[0];
            throw new InvalidOperationException("优先队列为空");
        }

        void SiftUp(int n)
        {
            var v = heap[n];
            for (var n2 = n / 2; n > 0 && comparer.Compare(v, heap[n2]) > 0; n = n2, n2 /= 2) heap[n] = heap[n2];
            heap[n] = v;
        }

        void SiftDown(int n)
        {
            var v = heap[n];
            for (var n2 = n * 2; n2 < Count; n = n2, n2 *= 2)
            {
                if (n2 + 1 < Count && comparer.Compare(heap[n2 + 1], heap[n2]) > 0) n2++;
                if (comparer.Compare(v, heap[n2]) >= 0) break;
                heap[n] = heap[n2];
            }
            heap[n] = v;
        }
    }



    class Program
    {
        public class PairCompare : IComparer<KeyValuePair<int, int>>
        {
            public int Compare(KeyValuePair<int, int> x, KeyValuePair<int, int> y)
            {
                if (Math.Abs(y.Value - x.Value) < 0)
                {
                    return 0;
                }
                if (x.Value > y.Value)
                    return -1;
                else
                    return 1;
            }
        }

        static void Main(string[] args)
        {
            PriorityQueue<KeyValuePair<int, int>> que = new PriorityQueue<KeyValuePair<int, int>>(new PairCompare());
            for (int i = 0; i < 5; i++)
            {
                var str = Console.ReadLine().Split(' ');
                que.Push(new KeyValuePair<int, int>(Int32.Parse(str[0]), Int32.Parse(str[1])));
            }

            Console.WriteLine("\n按值升序：");
            while (que.Count > 0)
            {
                var tmp = que.Pop();
                Console.WriteLine(tmp.Key + "," + tmp.Value);
            }
            Console.Read();
        }
    }
}