Fast sampling and update of weighted items? (data structure like red-black trees?)
utnick: What does the << operator mean?and how are these K items found? Do they have the same weight as the sampled item?