题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2020
思路:优先队列水过priority_queue
1 #include2 #include 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 9 10 class T11 {12 public:13 int x;14 T(int a):x(a)15 {16 17 }18 19 };20 21 22 bool operator < (const T &t1,const T &t2)23 {24 return fabs(t1.x) q;33 34 for(int i=0;i