My code processes a huge number of values and I'm looking for an efficient structure to keep track of the top (N) values, where N is less than 10, so collecting ALL numbers then sorting the list and taking the first (N) is probably not the most efficient way.My code processes a huge number of values and I
阅读背景：
固定大小的集合，保持顶级（N）值
来源：互联网
分享到：
