http://poj.org/problem?id=3253
1、O(n^2):for+Select()
超时
2、选k个最小值的算法用优先队列
参考:
posted on 2012-05-12 22:54 jjtx 阅读(195) 评论(0) 编辑 收藏 举报
Powered by: 博客园 Copyright © 2024 jjtx Powered by .NET 8.0 on Kubernetes