//来个优先队列的写法 //满足a.top() >= b.top()就同时消去 void solve() { int n, x, y; cin >> n >> x >> y; priority_queue<int, vector<int>, greater<int>...