title: Best data structure in C# for finding maximal value?
body: <p>I need to know which is the best data structure for finding a maximal value and is it implemented in C#? For now I'm using SortedDictioniry but it sorts the keys and basically I don't need the keys to be sorted but what I need is a faster way to find the maximal value. Also after I find the maximal value I need the key or the index corresponding to this value. Also if it is possible to have a quick insertion and quick removal of the elements, hopefully not more than O(log n). Is there such a structure and how can I use it?
  Thank you!</p>