Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|
Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |
pku月赛的一段报告:"如果我们用平衡树来维护这个集合,那么插入、删除与求第 k 小值的复杂度都是 O(logn) 级别的".请教STL,map有求第k小元素的函数?Followed by:
Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator