A man can be destroyed, but not defeated.

代码如下： //插入、删除、查询、遍历四种操作 #include #define rep(i,a,n) for(int (i) = a; (i)<=(n); (i)++) #define ms(a,b) memset((a),(b),sizeof((a))) using namespace std; typedef long long LL; const double eps = 1e-6; c

题目链接：http://poj.org/problem?id=2104. K-th Number Time Limit: 20000MS   Memory Limit: 65536K Total Submissions: 59744   Accepted: 20847 Case Time Limit: 2000MS