class Solution { private: priority_queue<int, vector<int>, less<int>> max_pq; // 大顶堆 priority_queue<int, vector<int>, greater<int>> min_pq; // 小顶堆 public: void Insert(int num) { if(max_pq.empty()){ max_pq.push(num); retu...