#include <queue> #include <vector> class Solution { public: priority_queue<int>min_q;//存放较小数据的大根堆,堆顶即为最大数 priority_queue<int,vector<int>,greater<int>>max_q; //存放较大数据的小根堆,堆顶即为最小数 void Insert(int num) { //约定当为奇数时,从大根堆取中位数,固先将数放入大根堆 min_q.push(num); max_q.push(min_q....