-
黑匣子
维护一个大根堆,维护一个小根堆,大根堆有k个数,堆首就是第k大的,不会写堆,这里用优先队列来实现12345678910111213141516171819202122232425262728293031323334353637383940414243#include<cstdio>#include<iostream>#include<queue>using na …
维护一个大根堆,维护一个小根堆,大根堆有k个数,堆首就是第k大的,不会写堆,这里用优先队列来实现12345678910111213141516171819202122232425262728293031323334353637383940414243#include<cstdio>#include<iostream>#include<queue>using na …